Sciweavers

1089 search results - page 150 / 218
» Bounds on generalized Frobenius numbers
Sort
View
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
FOCS
2000
IEEE
14 years 1 months ago
Nearly Optimal Expected-Case Planar Point Location
We consider the planar point location problem from the perspective of expected search time. We are given a planar polygonal subdivision S and for each polygon of the subdivision t...
Sunil Arya, Theocharis Malamatos, David M. Mount
VLDB
1997
ACM
97views Database» more  VLDB 1997»
14 years 1 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
AAAI
2010
13 years 10 months ago
Automated Program Debugging Via Multiple Predicate Switching
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...
Yongmei Liu, Bing Li
JACM
2007
132views more  JACM 2007»
13 years 8 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup