Sciweavers

1366 search results - page 113 / 274
» Modularizing Contexted Constraints
Sort
View
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 21 days ago
Efficient Approximation Algorithms for Repairing Inconsistent Databases
We consider the problem of repairing a database that is inconsistent wrt a set of integrity constraints by updating numerical values. In particular, we concentrate on denial integ...
Andrei Lopatenko, Loreto Bravo
RECOMB
2004
Springer
15 years 11 months ago
Structured motifs search
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
Alberto Policriti, Nicola Vitacolonna, Michele Mor...
DCC
2003
IEEE
15 years 11 months ago
PPM Model Cleaning
The Prediction by Partial Matching (PPM) algorithm uses a cumulative frequency count of input symbols in different contexts to estimate their probability distribution. Excellent c...
Milenko Drinic, Darko Kirovski, Miodrag Potkonjak
ICRA
2009
IEEE
125views Robotics» more  ICRA 2009»
15 years 6 months ago
A novel method for learning policies from constrained motion
— Many everyday human skills can be framed in terms of performing some task subject to constraints imposed by the environment. Constraints are usually unobservable and frequently...
Matthew Howard, Stefan Klanke, Michael Gienger, Ch...
CPAIOR
2009
Springer
15 years 6 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub