Sciweavers

2079 search results - page 177 / 416
» Universality of random graphs
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
LidarBoost: Depth Superresolution for ToF 3D Shape Scanning
Depth maps captured with time-of-flight cameras have very low data quality: the image resolution is rather limited and the level of random noise contained in the depth maps is v...
Sebastian Schuon (Stanford University), Christian ...
CVPR
2009
IEEE
17 years 1 months ago
Learning Based Automatic Face Annotation for Arbitrary Poses and Expressions from Frontal Images Only
Statistical approaches for building non-rigid deformable models, such as the Active Appearance Model (AAM), have enjoyed great popularity in recent years, but typically require ...
Akshay Asthana (Australian National University), R...
COLT
2004
Springer
15 years 12 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter
ALT
1997
Springer
15 years 10 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 12 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer