Sciweavers

13603 search results - page 200 / 2721
» On the Complexity of Computing Treelength
Sort
View
ICPR
2010
IEEE
15 years 9 months ago
Extracting Captions in Complex Background from Videos
—Captions in videos play a significant role for automatically understanding and indexing video content, since much semantic information is associated with them. This paper presen...
Xiaoqian Liu, Weiqiang Wang
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 8 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
TIT
2010
124views Education» more  TIT 2010»
14 years 11 months ago
Soft-input soft-output single tree-search sphere decoding
Soft-input soft-output (SISO) detection algorithms form the basis for iterative decoding. The computational complexity of SISO detection often poses significant challenges for prac...
Christoph Studer, Helmut Bölcskei
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 9 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 8 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani