736 search results - page 50 / 148 » A dynamic data structure for approximate range searching |
128
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
121
click to vote
ATVA
2009
Springer
15 years 10 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
138
Voted
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
133
Voted
ICANN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we present a system capable of dynamically learning shapes in a way that also allows for the dynamic deletion of shapes already learned. It uses a self-balancing Bin...
125
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...