Sciweavers

925 search results - page 71 / 185
» A Solution to the Extended GCD Problem
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 9 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
AUSAI
2009
Springer
14 years 3 months ago
Simple Default Reasoning in Theories of Action
We extend a recent approach to integrate action formalisms and non-monotonic reasoning. The resulting framework allows an agent employing an action theory as internal world model t...
Hannes Strass, Michael Thielscher
MLDM
2009
Springer
14 years 3 months ago
Relational Frequent Patterns Mining for Novelty Detection from Data Streams
We face the problem of novelty detection from stream data, that is, the identification of new or unknown situations in an ordered sequence of objects which arrive on-line, at cons...
Michelangelo Ceci, Annalisa Appice, Corrado Loglis...
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
14 years 3 months ago
Stereo matching for calibrated cameras without correspondence
Abstract— We study the stereo matching problem for reconstruction of the location of 3D-points on an unknown surface patch from two calibrated identical cameras without using any...
Uwe Helmke, Knut Hüper, L. Vences
APSEC
2005
IEEE
14 years 2 months ago
Call-Ordering Constraints
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
Nam Tran, David Abramson, Christine Mingins