Sciweavers

1170 search results - page 13 / 234
» Projective Visual Hulls
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
COLT
2010
Springer
13 years 5 months ago
Hedging Structured Concepts
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
Wouter M. Koolen, Manfred K. Warmuth, Jyrki Kivine...
RC
2000
99views more  RC 2000»
13 years 7 months ago
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations
Conventional plotting programs adopt techniques such as adaptive sampling to approximate, but not to guarantee, correctness and completeness in graphing functions. Moreover, implic...
Timothy J. Hickey, Zhe Qju, Maarten H. van Emden
ANOR
2005
131views more  ANOR 2005»
13 years 7 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
CVPR
2005
IEEE
14 years 9 months ago
Visibility Constrained Surface Evolution
The problem of feature-based surface reconstruction is considered in this paper. Our main contribution is the ability to handle visibility constraints, obtained from the projectio...
Jan Erik Solem, Fredrik Kahl, Anders Heyden