14699 search results - page 248 / 2940 » Complexity and Cognitive Computing |
112
click to vote
CP
2005
Springer
15 years 9 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...
131
click to vote
EUROCRYPT
1999
Springer
15 years 8 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...
181
click to vote
STOC
1996
ACM
15 years 8 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...
112
click to vote
ISSAC
1994
Springer
15 years 8 months ago
1994
Springer
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
119
click to vote
NIPS
2003
15 years 5 months ago
2003
We employ an efficient method using Bayesian and linear classifiers for analyzing the dynamics of information in high-dimensional states of generic cortical microcircuit models....