Sciweavers

17688 search results - page 41 / 3538
» Data Set Balancing
Sort
View
MIDDLEWARE
2004
Springer
15 years 7 months ago
Meghdoot: Content-Based Publish/Subscribe over P2P Networks
Publish/Subscribe systems have become a prevalent model for delivering data from producers (publishers) to consumers (subscribers) distributed across wide-area networks while decou...
Abhishek Gupta, Ozgur D. Sahin, Divyakant Agrawal,...
ISAAC
2005
Springer
129views Algorithms» more  ISAAC 2005»
15 years 7 months ago
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
Saeed Alaei, Mohammad Toossi, Mohammad Ghodsi
MFCS
2005
Springer
15 years 7 months ago
On Small Hard Leaf Languages
This paper deals with balanced leaf language complexity classes, introduced independently in [1] and [14]. We propose the seed concept for leaf languages, which allows us to give â...
Falk Unger
ICDCSW
2002
IEEE
15 years 7 months ago
Efficient Massive Sharing of Content among Peers
In this paper we focus on the design of high performance peer-to-peer content sharing systems. In particular, our goal is to achieve global load balancing and short user-request r...
Peter Triantafillou, Chryssani Xiruhaki, Manolis K...
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 6 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh