1951 search results - page 93 / 391 » An algorithm for improving graph partitions |
165
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
178
click to vote
ICDE
2011
IEEE
14 years 8 months ago
2011
IEEE
— Many data-intensive websites use databases that grow much faster than the rate that users access the data. Such growing datasets lead to ever-increasing space and performance o...
148
click to vote
CCGRID
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract In this paper, we propose the use of a distributed service management architecture for state-of-the-art service-enabled Grids. The architecture is capable of performing au...
143
click to vote
DOLAP
2004
ACM
15 years 9 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
156
click to vote
IJCAI
2003
15 years 5 months ago
2003
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...