Sciweavers

292 search results - page 28 / 59
» Are Stable Instances Easy
Sort
View
92
Voted
FSTTCS
2008
Springer
15 years 1 months ago
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
Georg Moser, Andreas Schnabl, Johannes Waldmann
CEC
2010
IEEE
15 years 29 days ago
Grammatical rules for the automated construction of heuristics
— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hype...
Germán Terrazas, Natalio Krasnogor
131
Voted
ACCV
2010
Springer
14 years 7 months ago
An Efficient RANSAC for 3D Object Recognition in Noisy and Occluded Scenes
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
Chavdar Papazov, Darius Burschka
TSMC
2010
14 years 7 months ago
A Mathematical Programming Solution to the Mars Express Memory Dumping Problem
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...
Giovanni Righini, Emanuele Tresoldi
106
Voted
ICPR
2010
IEEE
15 years 7 months ago
Dimension-Decoupled Gaussian Mixture Model for Short Utterance Speaker Recognition
The Gaussian Mixture Model (GMM) is often used in conjunction with Mel-frequency cepstral coefficient (MFCC) feature vectors for speaker recognition. A great challenge is to use ...
Thilo Stadelmann, Bernd Freisleben