Sciweavers

1977 search results - page 327 / 396
» Challenges for Data Mining in Distributed Sensor Networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 24 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICDE
2009
IEEE
153views Database» more  ICDE 2009»
14 years 10 months ago
Efficient Distribution of Full-Fledged XQuery
Abstract-- We investigate techniques to automatically decompose any XQuery query into subqueries, that can be executed near their data sources; i.e., function-shipping. In this sce...
Ying Zhang, Nan Tang, Peter A. Boncz
TKDE
2010
189views more  TKDE 2010»
13 years 7 months ago
Projective Distribution of XQuery with Updates
—We investigate techniques to automatically decompose any XQuery query—including updating queries specified by the XQuery Update Facility (XQUF)—into subqueries, that can be ...
Ying Zhang, Nan Tang, Peter A. Boncz
CIKM
2010
Springer
13 years 7 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 9 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec