Sciweavers

659 search results - page 109 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
IEEESCC
2009
IEEE
14 years 7 months ago
Theoretical Framework for Eliminating Redundancy in Workflows
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
Dhrubajyoti Saha, Abhishek Samanta, Smruti R. Sara...
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
15 years 3 months ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
99
Voted
SENSYS
2003
ACM
15 years 3 months ago
DFuse: a framework for distributed data fusion
Simple in-network data aggregation (or fusion) techniques for sensor networks have been the focus of several recent research efforts, but they are insufficient to support advance...
Rajnish Kumar, Matthew Wolenetz, Bikash Agarwalla,...
SASN
2004
ACM
15 years 3 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
MOBICOM
2003
ACM
15 years 3 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano