Sciweavers

151 search results - page 1 / 31
» Computable Shell Decomposition Bounds
Sort
View
COLT
2000
Springer
13 years 9 months ago
Computable Shell Decomposition Bounds
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
John Langford, David A. McAllester
JCB
2006
144views more  JCB 2006»
13 years 4 months ago
Modeling Virus Self-Assembly Pathways: Avoiding Dynamics Using Geometric Constraint Decomposition
We develop a model for elucidating the assembly pathways by which an icosahedral viral shell forms from 60 identical constituent protein monomers. This poorly understood process a...
Meera Sitharam, Mavis Agbandje-Mckenna
CGF
1998
101views more  CGF 1998»
13 years 4 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
CA
2000
IEEE
13 years 9 months ago
A Thin Shell Volume for Modeling Human Hair
Hair-to-hair interaction is often ignored in human hair modeling, due to its computational and algorithmic complexity. In this paper, we present our experimental approach to simul...
Tae-Yong Kim 0002, Ulrich Neumann
WG
1998
Springer
13 years 9 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics