Sciweavers

263 search results - page 30 / 53
» Combinatorial Shape Decomposition
Sort
View
PARA
2004
Springer
15 years 7 months ago
Improving the Performance of Large-Scale Unstructured PDE Applications
Abstract. This paper investigates two types of overhead due to duplicated local computations, which are frequently encountered in the parallel software of overlapping domain decomp...
Xing Cai
CCCG
2008
15 years 3 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...
BMCBI
2010
154views more  BMCBI 2010»
15 years 2 months ago
Binary image representation of a ligand binding site: its application to efficient sampling of a conformational ensemble
Background: Modelling the ligand binding site of a protein is an important component of understanding proteinligand interactions and is being actively studied. Even if the side ch...
Edon Sung, Sangsoo Kim, Whanchul Shin
CONCUR
2007
Springer
15 years 8 months ago
Rule-Based Modelling of Cellular Signalling
Abstract. Modelling is becoming a necessity in studying biological signalling pathways, because the combinatorial complexity of such systems rapidly overwhelms intuitive and qualit...
Vincent Danos, Jérôme Feret, Walter F...
CPM
2006
Springer
107views Combinatorics» more  CPM 2006»
15 years 5 months ago
Tiling an Interval of the Discrete Line
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
Olivier Bodini, Eric Rivals