Sciweavers

7228 search results - page 198 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ICRA
1994
IEEE
111views Robotics» more  ICRA 1994»
15 years 8 months ago
From Spider Robots to Half Disk Robots
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
ACL
2001
15 years 5 months ago
From Chunks to function-Argument Structure: A Similarity-Based Approach
Chunk parsing has focused on the recognition of partial constituent structures at the level of individual chunks. Little attention has been paid to the question of how such partia...
Sandra Kübler, Erhard W. Hinrichs
CVPR
2003
IEEE
16 years 6 months ago
Optimal Segmentation of Dynamic Scenes from Two Perspective Views
We present a novel algorithm for optimally segmenting dynamic scenes containing multiple rigidly moving objects. We cast the motion segmentation problem as a constrained nonlinear...
René Vidal, Shankar Sastry
SIGSOFT
2006
ACM
15 years 10 months ago
From multi-modal scenarios to code: compiling LSCs into aspectJ
We exploit the main similarity between the aspect-oriented programming paradigm and the inter-object, scenario-based approach to specification in order to construct a new way of ...
Shahar Maoz, David Harel
105
Voted
RT
2005
Springer
15 years 9 months ago
Fast Exact From-Region Visibility in Urban Scenes
We present a fast exact from-region visibility algorithm for 2.5D urban scenes. The algorithm uses a subdivision of line space for identifying visibility interactions in a 2D foot...
Jirí Bittner, Peter Wonka, Michael Wimmer