Sciweavers

36781 search results - page 301 / 7357
» Parameterizing by the Number of Numbers
Sort
View
185
Voted
DAM
2011
15 years 1 months ago
Minimum sum set coloring of trees and line graphs of trees
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...
Flavia Bonomo, Guillermo Durán, Javier Mare...
ICASSP
2011
IEEE
14 years 10 months ago
Parameter estimation using sparse reconstruction with dynamic dictionaries
We consider the problem of parameter estimation for signals characterized by sums of parameterized functions. We present a dynamic dictionary subset selection approach to paramete...
Christian D. Austin, Joshua N. Ash, Randolph L. Mo...
139
Voted
COCOON
2007
Springer
16 years 10 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
UIST
1995
ACM
15 years 9 months ago
Visual Interfaces for Solids Modeling
This paper exploresthe useof visualoperatorsfor solidsmodeling. We focus on designing interfaces for free-form operators such as blends, sweeps, and deformations, because these op...
Cindy Grimm, David Pugmire
ECCV
2008
Springer
15 years 8 months ago
3D Non-rigid Surface Matching and Registration Based on Holomorphic Differentials
3D surface matching is fundamental for shape registration, deformable 3D non-rigid tracking, recognition and classification. In this paper we describe a novel approach for generati...
Wei Zeng, Yun Zeng, Yang Wang, Xiaotian Yin, Xianf...