502 search results - page 28 / 101 » Verifying Balanced Trees |
92
Voted
ACIVS
2008
Springer
15 years 7 months ago
2008
Springer
The paper proposes a new parallel connected-component-tree construction algorithm based on line independent building and progressive merging of partial 1-D trees. Two parallelizati...
127
click to vote
AAMAS
2012
Springer
13 years 8 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
95
Voted
IJISEC
2002
15 years 10 days ago
2002
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously u...
95
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
112
Voted
ALENEX
2010
15 years 2 months ago
2010
We implement and compare the major current techniques for representing general trees in succinct form. This is important because a general tree of n nodes is usually represented i...