Sciweavers

1071 search results - page 188 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
ECCC
2010
83views more  ECCC 2010»
14 years 7 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
ECCV
2002
Springer
15 years 11 months ago
Composite Texture Descriptions
Textures can often more easily be described as a composition of subtextures than as a single texture. The paper proposes a way to model and synthesize such "composite textures...
Alexey Zalesny, Vittorio Ferrari, Geert Caenen, Do...
AGENTS
2000
Springer
15 years 2 months ago
Expressive autonomous cinematography for interactive virtual environments
We have created an automatic cinematography system for interactive virtual environments. This system controls a virtual camera and lights in a three-dimensional virtual world inha...
Bill Tomlinson, Bruce Blumberg, Delphine Nain
BMCBI
2008
242views more  BMCBI 2008»
14 years 9 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...
CGO
2011
IEEE
14 years 1 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...