Sciweavers

1801 search results - page 252 / 361
» Pointing without a pointer
Sort
View
CMOT
2010
176views more  CMOT 2010»
14 years 7 months ago
A cognitive model of spatial path-planning
Planning a path to a destination, given a number of options and obstacles, is a common task. We suggest a two-component cognitive model that combines retrieval of knowledge about t...
David Reitter, Christian Lebiere
IS
2010
14 years 7 months ago
Multicriteria reinforcement learning based on a Russian doll method for network routing
The routing in communication networks is typically a multicriteria decision making (MCDM) problem. However, setting the parameters of most used MCDM methods to fit the preferences ...
Alain Pétrowski, Farouk Aissanou, Ilham Ben...
CVPR
2011
IEEE
2153views Computer Vision» more  CVPR 2011»
14 years 6 months ago
The Light-Path Less Traveled
This paper extends classical object pose and relative camera motion estimation algorithms for imaging sensors sampling the scene through light-paths. Many algorithms in multi-view...
Srikumar Ramalingam, Sofien Bouaziz, Peter Sturm, ...
CG
2011
Springer
14 years 5 months ago
Multiresolutions numerically from subdivisions
In previous work we introduced a construction to produce multiresolutions from given subdivisions. A portion of that construction required solving bilinear equations using a symbo...
Richard H. Bartels, Faramarz Samavati
JCSS
2011
95views more  JCSS 2011»
14 years 4 months ago
Hardness results for approximating the bandwidth
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
Chandan K. Dubey, Uriel Feige, Walter Unger