Sciweavers

2600 search results - page 267 / 520
» Clustering with or without the Approximation
Sort
View
PODS
2003
ACM
132views Database» more  PODS 2003»
16 years 6 months ago
The view selection problem for XML content based routing
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy
MOBIHOC
2006
ACM
16 years 5 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
15 years 10 months ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
SIGIR
1998
ACM
15 years 10 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
15 years 7 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...