Sciweavers

14774 search results - page 2603 / 2955
» Computational complexity and evolutionary computation
Sort
View
CGF
1998
134views more  CGF 1998»
15 years 7 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 ...
222
Voted
IJCV
2002
157views more  IJCV 2002»
15 years 7 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
238
Voted
AI
1999
Springer
15 years 7 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
AROBOTS
1999
140views more  AROBOTS 1999»
15 years 7 months ago
A Robust Analog VLSI Motion Sensor Based on the Visual System of the Fly
Sensing visual motion gives a creature valuable information about its interactions with the environment. Flies in particular use visual motion information to navigate through turbu...
Reid R. Harrison, Christof Koch
DAM
1998
88views more  DAM 1998»
15 years 7 months ago
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
Stasys Jukna, Alexander A. Razborov
« Prev « First page 2603 / 2955 Last » Next »