Sciweavers

2370 search results - page 178 / 474
» A Structured Set of Higher-Order Problems
Sort
View
125
Voted
ICMCS
2009
IEEE
132views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Video face recognition with graph-based semi-supervised learning
We consider the problem of classification of multiple observations of the same object, possibly under different transformations. We view this problem as a special case of semi-sup...
Effrosini Kokiopoulou, Pascal Frossard
161
Voted
CPAIOR
2011
Springer
14 years 7 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
122
Voted
CP
2003
Springer
15 years 9 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano
135
Voted
FOCS
2000
IEEE
15 years 8 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
151
Voted
AGP
1999
IEEE
15 years 8 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...