1439 search results - page 19 / 288 » Fast approximation of centrality |
ASM
2010
ASM
14 years 5 months ago
2010
ASM
Identifying a minimal unsatisfiable core in an Alloy model proved to be a very useful feature in many scenarios. We extend this concept to hot core, an approximation to unsat core...
ACCV
2006
Springer
14 years 4 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
AAAI
2010
14 years 11 days ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
ECCV
2010
Springer
14 years 4 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
CPM
1998
Springer
14 years 3 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...