Sciweavers

10608 search results - page 119 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
14 years 2 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
ICMCS
1999
IEEE
164views Multimedia» more  ICMCS 1999»
14 years 2 months ago
A Semi-Automatic System to Infer Complex 3-D Shapes from Photographs
We present a semi-automatic image-based modeling system to make 3-D models from photographs. The human operator intervenes only for simple and straightforward tasks. The design of...
Qian Chen, Gérard G. Medioni
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
14 years 1 months ago
Genomic computing networks learn complex POMDPs
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
David J. Montana, Eric Van Wyk, Marshall Brinn, Jo...
COCO
2008
Springer
108views Algorithms» more  COCO 2008»
14 years 20 hour ago
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
Dmitry Gavinsky, Pavel Pudlák
EMNLP
2008
13 years 11 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney