2233 search results - page 118 / 447 » On the Complexity of Theory Curbing |
169
click to vote
SODA
2012
ACM
13 years 8 months ago
2012
ACM
We consider the sparse Fourier transform problem: given a complex vector x of length n, and a parameter k, estimate the k largest (in magnitude) coefficients of the Fourier transf...
149
click to vote
HICSS
2008
IEEE
16 years 25 days ago
2008
IEEE
Research has shown that decentralized networks and organizations perform better and have more satisfied members than centralized ones. Further, decentralized self-organizing netwo...
182
click to vote
LFCS
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
212
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
160
click to vote
ASIACRYPT
2009
Springer
16 years 29 days ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...