18306 search results - page 412 / 3662 » Algorithmics in Exponential Time |
151
click to vote
TOC
2008
15 years 7 months ago
2008
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
215
click to vote
FOCS
2010
IEEE
15 years 5 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
253
Voted
FSTTCS
2005
Springer
16 years 1 months ago
2005
Springer
We present novel algorithms for estimating the size of the natural join of two data streams that have efficient update processing times and provide excellent quality of estimates....
182
click to vote
PPAM
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. Replication methods can be used for shortening the data access time in Grid environment with heterogeneous storage resources. In this paper we describe the algorithms for...
163
Voted
DATE
2002
IEEE
16 years 13 days ago
2002
IEEE
This paper presents an innovative algorithm for the automatic generation of March Tests. The proposed approach is able to generate an optimal March Test for an unconstrained set o...