Sciweavers

51 search results - page 2 / 11
» The Packing Property
Sort
View
COLING
2000
13 years 7 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
Marc Dymetman, Frédéric Tendeau
ISPD
1999
ACM
112views Hardware» more  ISPD 1999»
13 years 10 months ago
Arbitrary convex and concave rectilinear block packing using sequence-pair
The sequence-pair was proposed in 1994 as a representation of the packing of rectangles of general structure. Since then, there have been e orts to expand its applicability over s...
Kunihiro Fujiyoshi, Hiroshi Murata
BMCBI
2006
108views more  BMCBI 2006»
13 years 6 months ago
NOXclass: prediction of protein-protein interaction types
Background: Structural models determined by X-ray crystallography play a central role in understanding protein-protein interactions at the molecular level. Interpretation of these...
Hongbo Zhu, Francisco S. Domingues, Ingolf Sommer,...
SODA
2010
ACM
162views Algorithms» more  SODA 2010»
14 years 3 months ago
The forest hiding problem
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
Adrian Dumitrescu, Minghui Jiang
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 1 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...