Sciweavers

9736 search results - page 20 / 1948
» How Fast Can We Compute Products
Sort
View
ICCV
2005
IEEE
15 years 10 months ago
Fast Head Tilt Detection for Human-Computer Interaction
Abstract. Accurate head tilt detection has a large potential to aid people with disabilities in the use of human-computer interfaces and provide universal access to communication s...
Benjamin N. Waber, John J. Magee, Margrit Betke
ICCSA
2004
Springer
15 years 9 months ago
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
Håkan Jonsson
ICPR
2008
IEEE
15 years 10 months ago
Fast and automatic reconstruction of structured illumination microscopy images with multiscale products
In this paper, we propose a new method to reconstruct high resolution images from structured illumination microscopy. It consists of estimating the illumination pattern parameters...
Clovis Tauber, Pedro Felipe Gardeazabal Rodriguez,...
DAC
1997
ACM
15 years 8 months ago
Modeling Design Tasks and Tools: The Link Between Product and Flow Model
- The important step towards a comprehensive CAD framework is the development of a suitable, complete design model on which the design system’s components are based. To date, we ...
Bernd Schürmann, Joachim Altmeyer
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 2 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg