2957 search results - page 264 / 592 » The Complexity of Polynomial-Time Approximation |
181
click to vote
SISAP
2009
IEEE
16 years 1 months ago
2009
IEEE
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
203
click to vote
ISAAC
2007
Springer
16 years 24 days ago
2007
Springer
In this paper, we present two linear-size external memory data structures for approximate range searching. Our first structure, the BAR-B-tree, stores a set of N points in Rd and ...
161
click to vote
SARA
2007
Springer
16 years 23 days ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
141
click to vote
ISCAS
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— This paper considers designing in the minimax sense complementary low-pass/high-pass approximately linear-phase recursive filters with variable magnitude characteristi...
173
click to vote
FC
2005
Springer
16 years 5 days ago
2005
Springer
Approximate Message Authentication Code (AMAC) is a recently introduced cryptographic primitive with several applications in the areas of cryptography and coding theory. Briefly s...