Sciweavers

363 search results - page 40 / 73
» Experiences in Building a Scalable Distributed Network Emula...
Sort
View
IPPS
2006
IEEE
14 years 2 months ago
Tree partition based parallel frequent pattern mining on shared memory systems
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
Dehao Chen, Chunrong Lai, Wei Hu, Wenguang Chen, Y...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 9 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...
MDM
2005
Springer
116views Communications» more  MDM 2005»
14 years 1 months ago
Data dissemination in mobile peer-to-peer networks
In this paper we propose adaptive content-driven routing and data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile ...
Thomas Repantis, Vana Kalogeraki
HT
1999
ACM
14 years 23 days ago
Control Choices and Network Effects in Hypertext Systems
When the utility of a hypertext system depends on the number of users and amount of data in the system, the system exhibits network effects. This paper examines how the core diffe...
E. James Whitehead Jr.