Sciweavers

1039 search results - page 24 / 208
» Query reformulation with constraints
Sort
View
SIAMJO
2008
141views more  SIAMJO 2008»
13 years 7 months ago
Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
Zi Xian Chan, Defeng Sun
DELTA
2006
IEEE
13 years 11 months ago
Using Design Patterns to Overcome Image Processing Constraints on FPGAs
The mapping of image processing algorithms to hardware is complicated by several hardware constraints including limited processing time, limited access to data and limited resourc...
K. T. Gribbon, Donald G. Bailey, Christopher T. Jo...
JUCS
2007
129views more  JUCS 2007»
13 years 7 months ago
Constraint Programming Architectures: Review and a New Proposal
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
Jacques Robin, Jairson Vitorino, Armin Wolf
ICMLA
2008
13 years 8 months ago
Probabilistic Exploitation of the Lucas and Kanade Smoothness Constraint
The basic idea of Lucas and Kanade is to constrain the local motion measurement by assuming a constant velocity within a spatial neighborhood. We reformulate this spatial constrai...
Volker Willert, Julian Eggert, Marc Toussaint, Edg...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
13 years 7 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan