Sciweavers

7006 search results - page 271 / 1402
» Approximation Algorithms
Sort
View
WASA
2009
Springer
126views Algorithms» more  WASA 2009»
15 years 10 months ago
Data Collection with Multiple Sinks in Wireless Sensor Networks
In this paper, we consider Multiple-Sink Data Collection Problem in wireless sensor networks, where a large amount of data from sensor nodes need to be transmitted to one of multip...
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Ki...
246
Voted
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 4 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
JCST
2008
175views more  JCST 2008»
15 years 3 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang
PSIVT
2009
Springer
139views Multimedia» more  PSIVT 2009»
15 years 8 months ago
Recovery Rate of Clustering Algorithms
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
Fajie Li, Reinhard Klette
ALGOSENSORS
2010
Springer
15 years 2 months ago
Lifetime Maximization of Monitoring Sensor Networks
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
Peter Sanders, Dennis Schieferdecker