Sciweavers

340 search results - page 60 / 68
» Clustering with Lower Bound on Similarity
Sort
View
WINET
2011
14 years 4 months ago
Aggregation convergecast scheduling in wireless sensor networks
Abstract—We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommo...
Baljeet Malhotra, Ioanis Nikolaidis, Mario A. Nasc...
COMPGEOM
2011
ACM
14 years 1 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
15 years 1 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo
ICALP
2009
Springer
15 years 9 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
15 years 9 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...