Sciweavers

613 search results - page 7 / 123
» The Memory Fragmentation Problem: Solved
Sort
View
STTT
2010
132views more  STTT 2010»
15 years 24 days ago
Evaluation of Kermeta for solving graph-based problems
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
Naouel Moha, Sagar Sen, Cyril Faucher, Olivier Bar...
120
Voted
MICCAI
2004
Springer
16 years 3 months ago
Solving Incrementally the Fitting and Detection Problems in fMRI Time Series
We tackle the problem of real-time statistical analysis of functional magnetic resonance imaging (fMRI) data. In a recent paper, we proposed an incremental algorithm based on the e...
Alexis Roche, Philippe Pinel, Stanislas Dehaene, J...
ICSE
2003
IEEE-ACM
16 years 2 months ago
Fragment Class Analysis for Testing of Polymorphism in Java Software
Testing of polymorphism in object-oriented software may require coverage of all possible bindings of receiver classes and target methods at call sites. Tools that measure this cove...
Atanas Rountev, Ana Milanova, Barbara G. Ryder
ECCV
2010
Springer
15 years 7 months ago
Affine Puzzle: Realigning Deformed Object Fragments without Correspondences
This paper is addressing the problem of realigning broken objects without correspondences. We consider linear transformations between the object fragments and present the method ...
Csaba Domokos and Zoltan Kato
121
Voted
EXPERT
2007
109views more  EXPERT 2007»
15 years 2 months ago
Mexar2: AI Solves Mission Planner Problems
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
Amedeo Cesta, Gabriella Cortellessa, Michel Denis,...