Sciweavers

999 search results - page 71 / 200
» Constraints in Non-Boolean Contexts
Sort
View
ICIP
1997
IEEE
16 years 7 months ago
Super-Resolution with Adaptive Regularization
Multi-channel super-resolution is a means of recovering high frequency information by trading off the temporal bandwidth. Almost all the methods proposed in the literature are bas...
Anne Lorette, Hassan Shekarforoush, Josiane Zerubi...
ICDE
2007
IEEE
126views Database» more  ICDE 2007»
16 years 7 months 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
16 years 6 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
16 years 5 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»
16 years 28 days 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...