12264 search results - page 2178 / 2453 » Analysis of the rubberband algorithm |
119
click to vote
PAKDD
2010
ACM
15 years 8 months ago
2010
ACM
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
146
Voted
CP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
101
Voted
DEBS
2007
ACM
15 years 8 months ago
2007
ACM
Recently, the publish-subscribe communication model has attracted the attention of developers as a viable alternative to traditional communication schemas, like request/reply, for...
144
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
: This paper presents a Least Popularly Used buffer cache algorithm to exploit both temporal locality and content locality of I/O requests. Popular data blocks are selected as refe...
136
click to vote
KDD
2010
ACM
15 years 8 months ago
2010
ACM
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...