313 search results - page 33 / 63 » Complete Local Search with Memory |
139
click to vote
DEXAW
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents two metrics for the Nearest Neighbor Classifier that share the property of being adapted, i.e. learned, on a set of data. Both metrics can be used for similari...
125
click to vote
ECCV
2010
Springer
15 years 7 months ago
2010
Springer
This paper introduces a very compact yet discriminative video description, which allows example-based search in a large number of frames corresponding to thousands of hours of vide...
118
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
126
click to vote
POPL
2000
ACM
15 years 6 months ago
2000
ACM
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
142
click to vote
CPHYSICS
2006
15 years 2 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...