Sciweavers

10988 search results - page 181 / 2198
» Algorithmic Folding Complexity
Sort
View
126
Voted
AIIA
2007
Springer
15 years 9 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta
NPAR
2004
ACM
15 years 9 months ago
Rendering complexity in computer-generated pen-and-ink illustrations
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
Brett Wilson, Kwan-Liu Ma
138
Voted
ALGOSENSORS
2004
Springer
15 years 9 months ago
On the Computational Complexity of Sensor Network Localization
Determining the positions of the sensor nodes in a network is essential to many network functionalities such as routing, coverage and tracking, and event detection. The localizatio...
James Aspnes, David Kiyoshi Goldenberg, Yang Richa...
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 8 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»
15 years 7 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