Sciweavers

712 search results - page 85 / 143
» Sorting and selection on dynamic data
Sort
View
ICC
2007
IEEE
115views Communications» more  ICC 2007»
15 years 6 months ago
Cooperation and Routing in Multi-Hop Networks
— We study the cross-layer problem of combining routing and cooperative diversity in multi-hop, bandwidthconstrained networks with dedicated multiple access. Previous work in coo...
Elzbieta Beres, Raviraj Adve
TPDS
2010
126views more  TPDS 2010»
14 years 6 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 1 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
PODS
2002
ACM
138views Database» more  PODS 2002»
16 years 4 hour ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava
INFOCOM
2007
IEEE
15 years 6 months ago
Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast
Abstract— This paper investigates the reliability of applicationlevel multicast based on a distributed hash table (DHT) in a highly dynamic network. Using a node residual lifetim...
Guang Tan, Stephen A. Jarvis