Sciweavers

728 search results - page 1 / 146
» Efficient Searching with Linear Constraints
Sort
View
PODS
1998
ACM
86views Database» more  PODS 1998»
13 years 8 months ago
Efficient Searching with Linear Constraints
An extended abstract of this paper appeared in Proceedings of the 15th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems [1]. 2 E-mail: pankaÄcs.duke.edu; httpÂ...
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo...
CP
2009
Springer
14 years 5 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey
DCC
2003
IEEE
14 years 4 months ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
CVPR
2007
IEEE
14 years 6 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
RECOMB
2004
Springer
14 years 4 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...