Sciweavers

2239 search results - page 228 / 448
» Computing with abstract matrix structures
Sort
View
142
Voted
IWEC
2010
15 years 2 months ago
Analyzing the Parameters of Prey-Predator Models for Simulation Games
Abstract—We describe and analyze emergent behavior and its effect for a class of preypredators’ simulation models. The simulation uses rule-based agent behavior and follows a p...
Seongdong Kim, Christoph Hoffmann, Varun Ramachand...
128
Voted
ECCV
2008
Springer
16 years 5 months ago
Solving Image Registration Problems Using Interior Point Methods
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
Camillo J. Taylor, Arvind Bhusnurmath
MFCS
2009
Springer
15 years 10 months ago
The Isomorphism Problem for k-Trees Is Complete for Logspace
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
Johannes Köbler, Sebastian Kuhnert
126
Voted
ICPP
2006
IEEE
15 years 9 months ago
Salsa: Scalable Asynchronous Replica Exchange for Parallel Molecular Dynamics Applications
— This paper presents Salsa, a novel, decentralized and asynchronous realization of the “replica exchange” algorithm for simulating the structure, function, folding, and dyna...
Li Zhang, Manish Parashar, Emilio Gallicchio, Rona...
130
Voted
TLCA
2005
Springer
15 years 9 months ago
Proof Contexts with Late Binding
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
Virgile Prevosto, Sylvain Boulmé