Sciweavers

4536 search results - page 130 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
SRDS
2010
IEEE
13 years 7 months ago
Crash-Tolerant Collision-Free Data Aggregation Scheduling for Wireless Sensor Networks
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
Arshad Jhumka
VLDB
1990
ACM
166views Database» more  VLDB 1990»
14 years 1 months ago
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failurefree environment t...
Divyakant Agrawal, Amr El Abbadi
IDA
2009
Springer
14 years 1 months ago
Visualization-Driven Structural and Statistical Analysis of Turbulent Flows
Knowledge extraction from data volumes of ever increasing size requires ever more flexible tools to facilitate interactive query. Interactivity enables real-time hypothesis testin...
Kenny Gruchalla, Mark Rast, Elizabeth Bradley, Joh...
PAMI
2011
13 years 4 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
NIPS
2008
13 years 10 months ago
Kernel Measures of Independence for non-iid Data
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
Xinhua Zhang, Le Song, Arthur Gretton, Alex J. Smo...