Sciweavers

4860 search results - page 536 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
DAGSTUHL
2004
15 years 6 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
COMCOM
2007
84views more  COMCOM 2007»
15 years 4 months ago
A genetic approach for adding QoS to distributed virtual environments
Distributed Virtual Environment (DVE) systems have been designed last years as a set of distributed servers. These systems allow a large number of remote users to share a single 3...
Silvia Rueda, Pedro Morillo, Juan M. Orduña...
IPPS
2010
IEEE
15 years 2 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ECCV
2004
Springer
16 years 6 months ago
A Constrained Semi-supervised Learning Approach to Data Association
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
Hendrik Kück, Nando de Freitas, Peter Carbone...
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
16 years 1 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein