Sciweavers

3055 search results - page 328 / 611
» Randomized Search Trees
Sort
View
SAT
2004
Springer
102views Hardware» more  SAT 2004»
15 years 9 months ago
Derandomization of Schuler's Algorithm for SAT
Abstract. Recently Schuler [17] presented a randomized algorithm that solves SAT in expected time at most 2n(1−1/ log2(2m)) up to a polynomial factor, where n and m are, respecti...
Evgeny Dantsin, Alexander Wolpert
124
Voted
BMCBI
2008
142views more  BMCBI 2008»
15 years 3 months ago
Optimal neighborhood indexing for protein similarity search
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
Pierre Peterlongo, Laurent Noé, Dominique L...
127
Voted
CVPR
2010
IEEE
15 years 2 months ago
Nonparametric Label-to-Region by Search
In this work, we investigate how to propagate annotated labels for a given single image from the image-level to their corresponding semantic regions, namely Label-toRegion (L2R), ...
Xiaobai Liu, Shuicheng Yan, Jiebo Luo
95
Voted
JOCN
2010
105views more  JOCN 2010»
15 years 2 months ago
Brain Structures Involved in Visual Search in the Presence and Absence of Color Singletons
■ It is still debated to what degree top–down and bottom–up driven attentional control processes are subserved by shared or by separate mechanisms. Interactions between thes...
Durk Talsma, Brian Coe, Douglas P. Munoz, Jan Thee...
277
Voted
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
16 years 5 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis