2254 search results - page 313 / 451 » Computing the minimal covering set |
208
click to vote
TOG
2012
13 years 8 months ago
2012
We present a technique for automatically synthesizing walking and running controllers for physically-simulated 3D humanoid characters. The sagittal hip, knee, and ankle degrees-of...
161
click to vote
OZCHI
2006
ACM
16 years 3 days ago
2006
ACM
One of the problems with notification appliances is that they can be distracting when providing information not of immediate interest to the user. In this paper, we present AuraOr...
145
Voted
AI
2006
Springer
15 years 6 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
145
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
148
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we address the problem of segmenting data defined on a manifold into a set of regions with uniform properties. In particular, we propose a numerical method when the ...