2107 search results - page 166 / 422 » Computing Small Search Numbers in Linear Time |
183
Voted
COCO
2009
Springer
16 years 29 days ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
159
click to vote
ICPP
2007
IEEE
16 years 21 days 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...
161
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
152
click to vote
ICCV
2005
IEEE
16 years 6 hour ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
177
click to vote
SIGMOD
1999
ACM
15 years 10 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...