32545 search results - page 238 / 6509 » Data Structures and Algorithms |
164
Voted
TIT
2010
14 years 10 months ago
2010
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
112
Voted
SAC
2002
ACM
15 years 3 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
136
Voted
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
107
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper an active noise control (ANC) algorithm is proposed. This algorithm is based on adaptive filtering with averaging (AFA) and uses a similar structure as that of the F...
126
click to vote
ISAAC
1995
Springer
15 years 7 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...