Sciweavers

2489 search results - page 313 / 498
» On the Subgroup Distance Problem
Sort
View
ICASSP
2010
IEEE
15 years 4 months ago
Action change detection in video by covariance matching of silhouette tunnels
Action recognition is an important but challenging problem in video analytics with a number of solutions proposed to date. However, even if a reliable model for action representat...
Kai Guo, Prakash Ishwar, Janusz Konrad
AROBOTS
2008
90views more  AROBOTS 2008»
15 years 4 months ago
Controller design for human-robot interaction
Many robotics tasks require a robot to share the same workspace with humans. In such settings, it is important that the robot performs in such a way that does not cause distress t...
Eric Meisner, Volkan Isler, Jeff Trinkle
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 4 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 4 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal