Sciweavers

5539 search results - page 36 / 1108
» What can be computed locally
Sort
View
ICPR
2004
IEEE
14 years 11 months ago
On Performance Evaluation of Face Detection and Localization Algorithms
When comparing different methods for face detection or localization, one realizes that just simply comparing the reported results is misleading as, even if the results are reporte...
Jean-Philippe Thiran, Sébastien Marcel, Vla...
ICRA
2005
IEEE
124views Robotics» more  ICRA 2005»
14 years 3 months ago
What Are the Ants Doing? Vision-Based Tracking and Reconstruction of Control Programs
— In this paper, we study the problem of going from a real-world, multi-agent system to the generation of control programs in an automatic fashion. In particular, a computer visi...
Magnus Egerstedt, Tucker R. Balch, Frank Dellaert,...
ICCS
2005
Springer
14 years 3 months ago
What Makes the Arc-Preserving Subsequence Problem Hard?
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
Guillaume Blin, Guillaume Fertin, Romeo Rizzi, St&...
NORDICHI
2004
ACM
14 years 3 months ago
Active co-construction of meaningful experiences: but what is the designer's role?
This talk discusses how to strike a good balance between making the user an active co-constructor of system functionality versus making a too strong, interpretative design that do...
Kristina Höök
SIGUCCS
2003
ACM
14 years 3 months ago
What's old is new again: training is the information technology constant
This paper is an account of some of the more instructive experiences we gained as we sought to ensure that our information technology training programs kept pace with a fast chang...
George Bradford