2095 search results - page 257 / 419 » Improved pebbling bounds |
173
click to vote
FUIN
2006
15 years 6 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
129
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—In our previous work, we introduced a double-sided technique that utilizes but not reject the host interference. Due to its nice property of utilizing but not rejecting the host...
158
click to vote
IPL
2006
15 years 6 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
154
click to vote
JGT
2008
15 years 6 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
183
Voted
JCT
2006
15 years 6 months ago
2006
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...