752 search results - page 71 / 151 » Faster approximation algorithms for the minimum latency prob... |
147
click to vote
CBMS
2005
IEEE
15 years 9 months ago
2005
IEEE
In this work we introduce the new problem of finding time series discords. Time series discords are subsequences of longer time series that are maximally different to all the rest...
121
click to vote
IJSNET
2008
15 years 3 months ago
2008
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
139
click to vote
SODA
2010
ACM
16 years 20 days ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
122
click to vote
SDM
2009
SIAM
16 years 14 days ago
2009
SIAM
In this paper, we propose GAD (General Activity Detection) for fast clustering on large scale data. Within this framework we design a set of algorithms for different scenarios: (...
130
Voted
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...