Sciweavers

4208 search results - page 470 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
144
Voted
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 3 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
132
Voted
ATAL
2006
Springer
15 years 7 months ago
Efficient agent-based cluster ensembles
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
Adrian K. Agogino, Kagan Tumer
BMCBI
2010
88views more  BMCBI 2010»
15 years 3 months ago
Robust probabilistic superposition and comparison of protein structures
Background: Protein structure comparison is a central issue in structural bioinformatics. The standard dissimilarity measure for protein structures is the root mean square deviati...
Martin Mechelke, Michael Habeck
132
Voted
MASS
2010
119views Communications» more  MASS 2010»
15 years 1 months ago
Energy-efficient data redistribution in sensor networks
We address the energy-efficient data redistribution problem in data intensive sensor networks (DISNs). The key question in sensor networks with large volumes of sensory data is how...
Bin Tang, Neeraj Jaggi, Haijie Wu, Rohini Kurkal
137
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 4 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine