Sciweavers

646 search results - page 106 / 130
» Generalized connected domination in graphs
Sort
View
CVGIP
2007
99views more  CVGIP 2007»
15 years 1 months ago
Meshless geometric subdivision
Point-based surface processing has developed into an attractive alternative to mesh-based processing techniques for a number of geometric modeling applications. By working with po...
Carsten Moenning, Facundo Mémoli, Guillermo...
TON
2002
144views more  TON 2002»
15 years 1 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
134
Voted
CVPR
2004
IEEE
16 years 3 months ago
Tracking Loose-Limbed People
We pose the problem of 3D human tracking as one of inference in a graphical model. Unlike traditional kinematic tree representations, our model of the body is a collection of loos...
Leonid Sigal, Sidharth Bhatia, Stefan Roth, Michae...
CATS
2008
15 years 3 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider
95
Voted
COCOA
2008
Springer
15 years 3 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner