Sciweavers

1071 search results - page 8 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
106
Voted
ICFP
2006
ACM
16 years 1 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
WSCG
2004
185views more  WSCG 2004»
15 years 3 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
EUROCOLT
1995
Springer
15 years 5 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
IVA
2007
Springer
15 years 8 months ago
T2D: Generating Dialogues Between Virtual Agents Automatically from Text
The Text2Dialogue (T2D) system that we are developing allows digital content creators to generate attractive multi-modal dialogues presented by two virtual agents—by simply provi...
Paul Piwek, Hugo Hernault, Helmut Prendinger, Mits...
111
Voted
CORR
2004
Springer
110views Education» more  CORR 2004»
15 years 1 months ago
Shannon Information and Kolmogorov Complexity
The elementary theories of Shannon information and Kolmogorov complexity are cmpared, the extent to which they have a common purpose, and where they are fundamentally different. T...
Peter Grünwald, Paul M. B. Vitányi