Sciweavers

3894 search results - page 588 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
159
Voted
JAIR
2010
115views more  JAIR 2010»
15 years 2 months ago
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
Raghav Aras, Alain Dutech
156
Voted
INFOCOM
2010
IEEE
15 years 1 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
225
Voted
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 4 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
135
Voted
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
15 years 7 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
189
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...