1074 search results - page 168 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
110
click to vote
KDD
2008
ACM
15 years 10 months ago
2008
ACM
: Locality Sensitive Hash functions are invaluable tools for approximate near neighbor problems in high dimensional spaces. In this work, we are focused on LSH schemes where the si...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
145
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...