Sciweavers

4542 search results - page 837 / 909
» Design patterns for data structures
Sort
View
AIEDU
2007
85views more  AIEDU 2007»
14 years 12 months ago
Opening up the Interpretation Process in an Open Learner Model
Opening a model of the learner is a potentially complex operation. There are many aspects of the learner that can be modelled, and many of these aspects may need to be opened in di...
Nicolas van Labeke, Paul Brna, Rafael Morales
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 12 months ago
3D Building Model Fitting Using A New Kinetic Framework
We describe a new approach to fit the polyhedron describing a 3D building model to the point cloud of a Digital Elevation Model (DEM). We introduce a new kinetic framework that hi...
Mathieu Brédif, Didier Boldo, Marc Pierrot ...
CPHYSICS
2008
121views more  CPHYSICS 2008»
14 years 12 months ago
A scalable parallel algorithm for large-scale reactive force-field molecular dynamics simulations
A scalable parallel algorithm has been designed to perform multimillion-atom molecular dynamics (MD) simulations, in which first principlesbased reactive force fields (ReaxFF) des...
Ken-ichi Nomura, Rajiv K. Kalia, Aiichiro Nakano, ...
CVIU
2008
180views more  CVIU 2008»
14 years 12 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
ECCC
2010
95views more  ECCC 2010»
14 years 12 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola