Sciweavers

102 search results - page 13 / 21
» A reading algorithm for constraint diagrams
Sort
View
COMPGEOM
2011
ACM
12 years 11 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,...
PVLDB
2008
110views more  PVLDB 2008»
13 years 7 months ago
Online maintenance of very large random samples on flash storage
Recent advances in flash media have made it an attractive alternative for data storage in a wide spectrum of computing devices, such as embedded sensors, mobile phones, PDA's...
Suman Nath, Phillip B. Gibbons
JCM
2006
129views more  JCM 2006»
13 years 7 months ago
T-ANT: A Nature-Inspired Data Gathering Protocol for Wireless Sensor Networks
There are many difficult challenges ahead in the design of an energy-efficient communication stack for wireless sensor networks. Due to the severe sensor node constraints, protocol...
S. Selvakennedy, Sukunesan Sinnappan, Yi Shang
EDBT
2008
ACM
167views Database» more  EDBT 2008»
14 years 8 months ago
HISSCLU: a hierarchical density-based method for semi-supervised clustering
In situations where class labels are known for a part of the objects, a cluster analysis respecting this information, i.e. semi-supervised clustering, can give insight into the cl...
Christian Böhm, Claudia Plant
GI
1999
Springer
14 years 4 days ago
Caching in Networks
d Abstract) Friedhelm Meyer auf der Heide   Berthold V¨ocking† Matthias Westermann   We present a general framework for the development of online algorithms for data manageme...
Matthias Westermann