3055 search results - page 208 / 611 » Randomized Search Trees |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
86
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
137
click to vote
BMCBI
2004
15 years 20 days ago
2004
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
128
click to vote
CHI
2001
ACM
16 years 1 months ago
2001
ACM
Eye tracking studies of the Hyperbolic Tree browser [10] suggest that visual search in focus+context displays is highly affected by information scent (i.e., local cues, such as te...
101
Voted
CP
2008
Springer
15 years 2 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...