Sciweavers

3820 search results - page 277 / 764
» Bounded Model Debugging
Sort
View
TIT
2010
153views Education» more  TIT 2010»
14 years 10 months ago
On the information rates of the plenoptic function
The plenoptic function (Adelson and Bergen, 91) describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) a...
Arthur L. da Cunha, Minh N. Do, Martin Vetterli
FAABS
2004
Springer
15 years 9 months ago
Two Formal Gas Models for Multi-agent Sweeping and Obstacle Avoidance
Abstract. The task addressed here is a dynamic search through a bounded region, while avoiding multiple large obstacles, such as buildings. In the case of limited sensors and commu...
Wesley Kerr, Diana F. Spears, William M. Spears, D...
153
Voted
FSTTCS
1998
Springer
15 years 8 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
ALT
2006
Springer
16 years 23 days ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber
ADC
2006
Springer
136views Database» more  ADC 2006»
15 years 9 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao