Sciweavers

4541 search results - page 110 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
14 years 2 months ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
SRDS
2010
IEEE
14 years 9 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»
15 years 3 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
15 years 3 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...
NIPS
2008
15 years 20 days 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...