2520 search results - page 153 / 504 » The complexity of approximating entropy |
102
click to vote
ISAAC
2007
Springer
15 years 5 months 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 ...
81
Voted
SARA
2007
Springer
15 years 5 months 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...
ISCAS
2006
IEEE
15 years 4 months 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...
FC
2005
Springer
15 years 4 months 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...
ATAL
2004
Springer
15 years 4 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...