843 search results - page 37 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
194
Voted
IPPS
2002
IEEE
16 years 10 days ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
191
click to vote
CP
2003
Springer
16 years 19 days ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
182
Voted
AAAI
2004
15 years 8 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
185
Voted
JSC
2008
15 years 7 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
265
Voted
EUSFLAT
2009
15 years 5 months ago
2009
This paper proposes an optimization strategy which is based on neural networks and genetic algorithms to calculate the optimal values of gas injection rate and oil rate for oil pro...