Sciweavers

14121 search results - page 558 / 2825
» Interval Computations in Computer Vision
Sort
View
CHI
2009
ACM
16 years 7 months ago
Using temporal patterns (t-patterns) to derive stress factors of routine tasks
We describe the use of a statistical technique called Tpattern analysis to derive and characterize the routineness of tasks. T-patterns provide significant advantages over traditi...
Oliver Brdiczka, Norman Makoto Su, Bo Begole
SAC
2010
ACM
16 years 1 months ago
Variable ranges in linear constraints
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
Salvatore Ruggieri, Fred Mesnard
FOCS
2009
IEEE
16 years 1 months ago
Decomposing Coverings and the Planar Sensor Cover Problem
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
Matt Gibson, Kasturi R. Varadarajan
IROS
2009
IEEE
125views Robotics» more  IROS 2009»
16 years 1 months ago
Planning and fast re-planning of safe motions for humanoid robots: Application to a kicking motion
Abstract— Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchm...
Sebastien Lengagne, Philippe Fraisse, Nacim Ramdan...
ICCS
2009
Springer
16 years 1 months ago
A Second Order Adjoint Method to Targeted Observations
The role of the second order adjoint in targeting strategies is studied and analyzed. Most targeting strategies use the first order adjoint to identify regions where additional in...
Humberto C. Godinez, Dacian N. Daescu