1776 search results - page 188 / 356 » Uncertain Linear Constraints |
167
click to vote
SMI
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
159
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
149
click to vote
SIGGRAPH
1998
ACM
15 years 10 months ago
1998
ACM
The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably ta...
134
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a novel boosting algorithm, called SoftBoost, designed for sets of binary labeled examples that are not necessarily separable by convex combinations of base hypotheses....
169
Voted
IJCAI
2003
15 years 7 months ago
2003
This paper presents a new scenario recognition algorithm for Video Interpretation. We represent a scenario model by specifying the characters involved in the scenario, the sub-sce...