3946 search results - page 239 / 790 » The computational complexity of choice sets |
188
click to vote
MIRAGE
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. In this paper we take a fresh look at the problem of extracting shape from contours of human faces. We focus on two key questions: how can we robustly fit a 3D face mode...
155
click to vote
ACSC
2005
IEEE
16 years 9 days ago
2005
IEEE
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...
182
click to vote
PAM
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
181
click to vote
DAC
1997
ACM
15 years 11 months ago
1997
ACM
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
185
click to vote
CONCUR
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...