Sciweavers

239 search results - page 15 / 48
» The Parameterized Complexity of Global Constraints
Sort
View
ACTA
2002
111views more  ACTA 2002»
13 years 7 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
IS
2007
13 years 7 months ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki
EAAI
2010
119views more  EAAI 2010»
13 years 6 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
CVPR
1996
IEEE
14 years 9 months ago
Skin and Bones: Multi-layer, Locally Affine, Optical Flow and Regularization with Transparency
This paper describes a new method for estimating optical flow that strikes a balance between the flexibility of local dense computations and the robustness and accuracy of global ...
Shanon X. Ju, Michael J. Black, Allan D. Jepson
ICPR
2010
IEEE
14 years 2 months ago
Semi-Supervised Distance Metric Learning by Quadratic Programming
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
Hakan Cevikalp