2080 search results - page 185 / 416 » Measuring empirical computational complexity |
132
Voted
IROS
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— Grasp quality measures are important for understanding how to plan for and maintain appropriate and secure grasps for pick and place operations and tool use. Most grasp...
154
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
165
click to vote
EGPGV
2004
Springer
15 years 10 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
131
Voted
CHI
2005
ACM
16 years 5 months ago
2005
ACM
To contribute to systems that reason about human attention, our work empirically demonstrates how a user's mental workload changes during task execution. We conducted a study...
174
Voted
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Visual tracking is a challenging problem, as an object may change its appearance due to pose variations, illumination changes, and occlusions. Many algorithms have been proposed t...