17541 search results - page 422 / 3509 » Complexity in scalable computing |
150
click to vote
WABI
2001
Springer
15 years 9 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
135
click to vote
LOGCOM
2007
15 years 5 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
116
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
140
click to vote
EUROCRYPT
1999
Springer
15 years 9 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
192
Voted
STOC
1996
ACM
15 years 9 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...