Sciweavers

1279 search results - page 117 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
RECOMB
2003
Springer
14 years 9 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila
ATAL
2008
Springer
13 years 11 months ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
SIGIR
2009
ACM
14 years 3 months ago
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
Jimmy J. Lin
JACM
2000
131views more  JACM 2000»
13 years 8 months ago
The soft heap: an approximate priority queue with optimal error rate
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
Bernard Chazelle
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu