Sciweavers

3019 search results - page 273 / 604
» Approximating the Domatic Number
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
A union of incoherent spaces model for classification
We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data...
Karin Schnass, Pierre Vandergheynst
157
Voted
CGF
2008
110views more  CGF 2008»
15 years 6 months ago
Motorcycle Graphs: Canonical Quad Mesh Partitioning
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
David Eppstein, Michael T. Goodrich, Ethan Kim, Ra...
157
Voted
EOR
2006
68views more  EOR 2006»
15 years 6 months ago
Evaluation of time-varying availability in multi-echelon spare parts systems with passivation
The popular models for repairable item inventory, both in the literature as well as practical applications, assume that the demands for items are independent of the number of work...
Hoong Chuin Lau, Huawei Song, Chuen Teck See, Siew...
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 6 months ago
Longest Common Separable Pattern between Permutations
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
Mathilde Bouvel, Dominique Rossin, Stéphane...
178
Voted
JCO
2008
84views more  JCO 2008»
15 years 6 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma