Sciweavers

284 search results - page 12 / 57
» What Matchings Can Be Stable
Sort
View
MICCAI
2008
Springer
14 years 9 months ago
Fast Musculoskeletal Registration Based on Shape Matching
This paper presents a new method for computing elastic and plastic deformations in the context of discrete deformable model-based registration. Internal forces are estimated by ave...
Benjamin Gilles, Dinesh K. Pai
MAAMAW
1994
Springer
14 years 15 days ago
What Ants Cannot Do
What is the relation between the complexity of agents and the complexity of the goals that they can achieve? It is argued on the basis of a fundamental conservation of complexity ...
Eric Werner
SEMWEB
2009
Springer
14 years 3 months ago
Results of OKKAM Feature based Entity Matching Algorithm for Instance Matching Contest of OAEI 2009
To investigate the problem of entity recognition, we deal with the creation of the so-called Entity Name System (ENS) which is an open, public back-bone infrastructure for the (Sem...
Heiko Stoermer, Nataliya Rassadko
ISSTA
2012
ACM
11 years 11 months ago
Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say
A static analysis design is sufficient if it can prove the property of interest with an acceptable number of false alarms. Ultimately, the only way to confirm that an analysis d...
Devin Coughlin, Bor-Yuh Evan Chang, Amer Diwan, Je...
LKR
2008
13 years 10 months ago
What Types of Translations Hide in Wikipedia?
Abstract. We extend an automatically generated bilingual JapaneseSwedish dictionary with new translations, automatically discovered from the multi-lingual online encyclopedia Wikip...
Jonas Sjöbergh, Olof Sjöbergh, Kenji Ara...