Sciweavers

3791 search results - page 10 / 759
» Packing sets of patterns
Sort
View
DM
2008
88views more  DM 2008»
13 years 7 months ago
Packing triangles in low degree graphs and indifference graphs
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
Gordana Manic, Yoshiko Wakabayashi
CC
2006
Springer
123views System Software» more  CC 2006»
13 years 7 months ago
On the complexity of approximating k-set packing
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
Elad Hazan, Shmuel Safra, Oded Schwartz
VLSID
2002
IEEE
95views VLSI» more  VLSID 2002»
14 years 7 months ago
Design of an On-Chip Test Pattern Generator without Prohibited Pattern Set (PPS)
| This paper reports the design of a Test Pattern Generator (TPG) for VLSI circuits. The onchip TPG is so designed that it generates test patterns while avoiding generation of a gi...
Niloy Ganguly, Biplab K. Sikdar, Parimal Pal Chaud...
JCC
2002
88views more  JCC 2002»
13 years 7 months ago
Pattern recognition strategies for molecular surfaces. I. Pattern generation using fuzzy set theory
: A new method for the characterization of molecules based on the model approach of molecular surfaces is presented. We use the topographical properties of the surface as well as t...
Thomas E. Exner, Matthias Keil, Jürgen Brickm...
TOG
2002
212views more  TOG 2002»
13 years 7 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...