Sciweavers

46 search results - page 2 / 10
» Hinged dissections exist
Sort
View
SCM
2003
13 years 7 months ago
Dissecting Configuration Management Policies
A configuration management policy specifies the procedures through which a user evolves artifacts stored in a configuration management system. Different configuration management sy...
Ronald van der Lingen, André van der Hoek
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
13 years 9 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo
BMCBI
2006
90views more  BMCBI 2006»
13 years 6 months ago
Dissecting trait heterogeneity: a comparison of three clustering methods applied to genotypic data
Background: Trait heterogeneity, which exists when a trait has been defined with insufficient specificity such that it is actually two or more distinct traits, has been implicated...
Tricia A. Thornton-Wells, Jason H. Moore, Jonathan...
BMCBI
2010
156views more  BMCBI 2010»
13 years 6 months ago
Mathematical model for empirically optimizing large scale production of soluble protein domains
Background: Efficient dissection of large proteins into their structural domains is critical for high throughput proteome analysis. So far, no study has focused on mathematically ...
Eisuke Chikayama, Atsushi Kurotani, Takanori Tanak...
JCDCG
2000
Springer
13 years 9 months ago
Sequentially Divisible Dissections of Simple Polygons
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
Jin Akiyama, Toshinori Sakai, Jorge Urrutia