Sciweavers

1450 search results - page 272 / 290
» A New General Purpose Parallel Database System
Sort
View
125
Voted
PODC
2003
ACM
15 years 8 months ago
Geometric ad-hoc routing: of theory and practice
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
Fabian Kuhn, Roger Wattenhofer, Yan Zhang, Aaron Z...
127
Voted
DEBS
2008
ACM
15 years 5 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
WWW
2011
ACM
14 years 10 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
117
Voted
CHI
2011
ACM
14 years 7 months ago
Computers can't give credit: how automatic attribution falls short in an online remixing community
In this paper, we explore the role that attribution plays in shaping user reactions to content reuse, or remixing, in a large user-generated content community. We present two stud...
Andrés Monroy-Hernández, Benjamin Ma...
154
Voted
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan