Sciweavers

158 search results - page 14 / 32
» Approximate Range Mode and Range Median Queries
Sort
View
OPODIS
2007
13 years 8 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
DAC
1999
ACM
14 years 7 months ago
An Efficient Lyapunov Equation-Based Approach for Generating Reduced-Order Models of Interconnect
In this paper we present a new algorithm for computing reduced-order models of interconnect which utilizes the dominant controllable subspace of the system. The dominant controlla...
Jing-Rebecca Li, Frank Wang, Jacob White
GIS
2007
ACM
14 years 7 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
JEA
2008
112views more  JEA 2008»
13 years 6 months ago
Dynamic spatial approximation trees
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
Gonzalo Navarro, Nora Reyes
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li