Sciweavers

229 search results - page 21 / 46
» Speeding Up Two String-Matching Algorithms
Sort
View
AAAI
2006
13 years 9 months ago
Learning Partially Observable Action Schemas
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
Dafna Shahaf, Eyal Amir
TSP
2010
13 years 2 months ago
Efficient Maximum Entropy Reconstruction of Nuclear Magnetic Resonance T1-T2 Spectra
Abstract--This paper deals with the reconstruction of T1-T2 correlation spectra in nuclear magnetic resonance relaxometry. The ill-posed character and the large size of this invers...
Emilie Chouzenoux, Saïd Moussaoui, Jér...
CVPR
2009
IEEE
15 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
CGF
2002
168views more  CGF 2002»
13 years 7 months ago
Fast Continuous Collision Detection between Rigid Bodies
This paper introduces a fast continuous collision detection technique for polyhedral rigid bodies. As opposed to most collision detection techniques, the computation of the first ...
Stephane Redon, Abderrahmane Kheddar, Sabine Coqui...
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
14 years 1 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce