Sciweavers

17541 search results - page 3160 / 3509
» Complexity in scalable computing
Sort
View
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 6 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
ASE
1998
81views more  ASE 1998»
15 years 6 months ago
Program Understanding as Constraint Satisfaction: Representation and Reasoning Techniques
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
Steven G. Woods, Qiang Yang
CGF
1998
134views more  CGF 1998»
15 years 6 months ago
Progressive Iso-Surface Extraction from Hierarchical 3D Meshes
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
Wenli Cai, Georgios Sakas, Roberto Grosso, Thomas ...
IJCV
2002
157views more  IJCV 2002»
15 years 6 months ago
Dense Features for Semi-Dense Stereo Correspondence
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler
AI
1999
Springer
15 years 6 months ago
Cooperative Behavior Acquisition for Mobile Robots in Dynamically Changing Real Worlds Via Vision-Based Reinforcement Learning a
In this paper, we first discuss the meaning of physical embodiment and the complexity of the environment in the context of multi-agent learning. We then propose a vision-based rei...
Minoru Asada, Eiji Uchibe, Koh Hosoda
« Prev « First page 3160 / 3509 Last » Next »