Sciweavers

3154 search results - page 240 / 631
» Computing Closed Skycubes
Sort
View
DAM
2010
86views more  DAM 2010»
15 years 6 months ago
Minimum fill-in and treewidth of split+ke and split+kv graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For t...
Federico Mancini
CPHYSICS
2008
53views more  CPHYSICS 2008»
15 years 6 months ago
Long-time self-diffusion for Brownian Gaussian-core particles
Using extensive Brownian dynamics computer simulations, the long-time self-diffusion coefficient is calculated for Gaussian-core particles as a function of the number density. Bot...
H. H. Wensink, H. Löwen, M. Rex, C. N. Likos,...
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
ARTMED
2006
108views more  ARTMED 2006»
15 years 6 months ago
Constructing explanatory process models from biological data and knowledge
We address the task of inducing explanatory models from observations and knowledge about candidate biological processes, using the illustrative problem of modeling photosynthesis ...
Pat Langley, Oren Shiran, Jeff Shrager, Ljupco Tod...
CGF
2006
177views more  CGF 2006»
15 years 6 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...