Search Results for "mark"
Sort By:
Showing 3 open source projects for "mark"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
...This code is fast, but is not terribly easy to use. The algorithm is robust to some noise, but requires a lot of parameter tuning. Enjoy at your own risk :), Mark Iwen -
2
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
...Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne -
3
An implementation of the sparse FFT algorithms discovered by Mark Iwen and described in http://www.math.duke.edu/~markiwen/DukePage/Papers/JcFFTsubmit.pdf. Used for benchmarking in http://www.ima.umn.edu/preprints/jul2010/2326.pdf.
- Previous
- You're on page 1
- Next
