Sciweavers

261 search results - page 41 / 53
» On Threshold BDDs and the Optimal Variable Ordering Problem
Sort
View
MCS
2002
Springer
15 years 5 months ago
A Discussion on the Classifier Projection Space for Classifier Combining
In classifier combining, one tries to fuse the information that is given by a set of base classifiers. In such a process, one of the difficulties is how to deal with the variabilit...
Elzbieta Pekalska, Robert P. W. Duin, Marina Skuri...
152
Voted
SIGECOM
2009
ACM
91views ECommerce» more  SIGECOM 2009»
16 years 5 days ago
Destroy to save
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
Geoffroy de Clippel, Victor Naroditskiy, Amy R. Gr...
CVPR
2010
IEEE
15 years 8 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
CP
1995
Springer
15 years 9 months ago
Optimization-based Heuristics for Maximal Constraint Satisfaction
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
Javier Larrosa, Pedro Meseguer
CSR
2007
Springer
15 years 12 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka