Sciweavers

1244 search results - page 60 / 249
» Searching in Higher Dimension
Sort
View
AAAI
1996
13 years 11 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
CONCURRENCY
2002
107views more  CONCURRENCY 2002»
13 years 9 months ago
A callgraph-based search strategy for automated performance diagnosis
Abstract. We introduce a new technique for automated performance diagnosis, using the program's callgraph. We discuss our implementation of this diagnosis technique in the Par...
Harold W. Cain, Barton P. Miller, Brian J. N. Wyli...
DSMML
2004
Springer
14 years 3 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
14 years 2 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
DEXA
2006
Springer
190views Database» more  DEXA 2006»
14 years 1 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic