9849 search results - page 10 / 1970 » Algorithms and Experiments for the Webgraph |
158
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
90
Voted
DEXA
2010
Springer
14 years 9 months ago
2010
Springer
We consider the containment problem for conjunctive queries with atomic negation. Firstly, we refine an existing algorithm based on homomorphism checks, which itself improves other...
CPE
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we pre...
BIRTHDAY
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. A novel framework for the design and analysis of energy-aware algorithms is presented, centered around a deterministic Bit-level (Boltzmann) Random Access Machine or BRAM...
PARA
2000
Springer
15 years 1 months ago
2000
Springer
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...