1921 search results - page 142 / 385 » Stereo Without Search |
117
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
This paper proposes and evaluates Prefetching B+ -Trees pB+ -Trees, which use prefetching to accelerate two important operations on B+ -Tree indices: searches and range scans. To ...
145
click to vote
IWOMP
2009
Springer
15 years 10 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
126
Voted
ICPP
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper, a novel packet classification scheme optimized for multi-core network processors is proposed. The algorithm, Explicit Cuttings (ExpCuts), adopts a hierarchical spac...
119
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a novel approach to clustering using an accuracy-based Learning Classifier System. Our approach achieves this by exploiting the generalization mechanisms inher...
111
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Support Vector Machines (SVMs) for classification tasks produce sparse models by maximizing the margin. Two limitations of this technique are considered in this work: firstly, th...