4302 search results - page 278 / 861 » Index Pairs Algorithms |
220
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
162
click to vote
MM
2005
ACM
15 years 10 months ago
2005
ACM
This work achieves full registration of scenes in a large area and creates visual indexes for visualization in a digital city. We explore effective mapping, indexing, and display ...
167
click to vote
TSE
2008
15 years 4 months ago
2008
Software end users are the best testers, who keep revealing bugs in software that has undergone rigorous in-house testing. In order to leverage their testing efforts, failure repor...
131
click to vote
ALT
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Smooth boosting algorithms are variants of boosting methods which handle only smooth distributions on the data. They are proved to be noise-tolerant and can be used in th...
120
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...