1518 search results - page 122 / 304 » Exact and Approximate Bandwidth |
166
click to vote
ISAAC
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
145
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We show several PAC-style concentration bounds for learning unigrams language model. One interesting quantity is the probability of all words appearing exactly k times in...
165
click to vote
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
179
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
180
click to vote
DATESO
2007
15 years 7 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...