Sciweavers

320 search results - page 41 / 64
» A three-state model of graphical input
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
14 years 11 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
AAAI
2000
14 years 10 months ago
The Systems Engineering Process Activities (SEPA) Methodology and Tool Suite
or cone, abstraction is chosen to represent a spectrum of user inputs/requirements that are narrowed, refined, and structured into a system design. User inputs require refinement f...
K. Suzanne Barber, Thomas J. Graser, Paul Grisham,...
SGP
2007
14 years 12 months ago
Dynamic geometry registration
We propose an algorithm that performs registration of large sets of unstructured point clouds of moving and deforming objects without computing correspondences. Given as input a s...
Niloy J. Mitra, Simon Flöry, Maks Ovsjanikov,...
CGF
2005
156views more  CGF 2005»
14 years 9 months ago
Efficient Animation of Point-Sampled Thin Shells
We present a novel framework for the efficient simulation and animation of discrete thin shells. Our method takes a point sampled surface as input and performs all necessary compu...
Martin Wicke, Denis Steinemann, Markus H. Gross
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
15 years 2 months ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda