Sciweavers

3055 search results - page 277 / 611
» Randomized Search Trees
Sort
View
CSB
2004
IEEE
126views Bioinformatics» more  CSB 2004»
15 years 7 months ago
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
Pei Wang, Young Kim, Jonathan R. Pollack, Robert T...
136
Voted
ICDE
2010
IEEE
174views Database» more  ICDE 2010»
15 years 1 months ago
Semantic flooding: Search over semantic links
Abstract-- Classification hierarchies are trees where links codify the fact that a node lower in the hierarchy contains documents whose contents are more specific than those one le...
Fausto Giunchiglia, Uladzimir Kharkevich, Alethia ...
134
Voted
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
15 years 5 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
16 years 3 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
ICALP
2003
Springer
15 years 8 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf