Sciweavers

1823 search results - page 86 / 365
» Distributed lossy averaging
Sort
View
FLAIRS
2007
15 years 6 months ago
Mining Sequences in Distributed Sensors Data for Energy Production
The desire to predict power generation at a given point in time is essential to power scheduling, energy trading, and availability modeling. The research conducted within is conce...
Mehmed M. Kantardzic, John Gant
HPCN
1995
Springer
15 years 7 months ago
Parallel performance evaluation through critical path analysis
Abstract. In this paper we discuss the concept of space-time diagrams as a representation of the execution of an application, and then give a method, based on critical path analysi...
Benno J. Overeinder, Peter M. A. Sloot
SIGCOMM
2004
ACM
15 years 9 months ago
An algebraic approach to practical and scalable overlay network monitoring
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
Yan Chen, David Bindel, Han Hee Song, Randy H. Kat...
INFOCOM
2000
IEEE
15 years 8 months ago
Layered Multicast Recovery
We study the problem of localizing repair packets when packets are lost. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast “group” wi...
Injong Rhee, Srinath R. Joshi, Minsuk Lee, S. Muth...
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 10 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...