Sciweavers

497 search results - page 44 / 100
» Approximating max-min linear programs with local algorithms
Sort
View
INFORMS
1998
150views more  INFORMS 1998»
14 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ICPR
2006
IEEE
15 years 11 months ago
A Regression Model in TensorPCA Subspace for Face Image Super-resolution Reconstruction
A regression model in the tensorPCA subspace is proposed in this paper for face super-resolution reconstruction. An approximate conditional probability model is used for the tenso...
Junwen Wu, Mohan M. Trivedi
ICVGIP
2004
14 years 11 months ago
Local Correlation-based Fingerprint Matching
Most fingerprint matching systems are based on matching minutia points between two fingerprint images. Each minutia is represented by a fixed number of attributes such as the loca...
Karthik Nandakumar, Anil K. Jain
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
15 years 2 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
ORL
2006
105views more  ORL 2006»
14 years 9 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...