Sciweavers

1550 search results - page 99 / 310
» Optimizing search by showing results in context
Sort
View
CVPR
2010
IEEE
13 years 8 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
ECTEL
2007
Springer
14 years 3 months ago
Relevance Ranking Metrics for Learning Objects
— The main objetive of this paper is to improve the current status of learning object search. First, the current situation is analyzed and a theretical solution, based on relevan...
Xavier Ochoa, Erik Duval
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 9 months ago
Barriers and local minima in energy landscapes of stochastic local search
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...
Petteri Kaski
SAT
2007
Springer
107views Hardware» more  SAT 2007»
14 years 3 months ago
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
Chu Min Li, Wanxia Wei, Harry Zhang
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 4 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox