348 search results - page 40 / 70 » Using Curvature Information for Fast Stochastic Search |
122
click to vote
CIKM
2003
Springer
15 years 9 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
126
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
156
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
134
click to vote
LATIN
1998
Springer
15 years 8 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
132
click to vote
IAT
2006
IEEE
15 years 10 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...