Sciweavers

2740 search results - page 419 / 548
» Approximating Component Selection
Sort
View
122
Voted
AI
2002
Springer
15 years 17 days ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
107
Voted
PAMI
2010
205views more  PAMI 2010»
14 years 11 months ago
Learning a Hierarchical Deformable Template for Rapid Deformable Object Parsing
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
Long Zhu, Yuanhao Chen, Alan L. Yuille
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
14 years 10 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
148
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 7 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
163
Voted
AAMAS
2011
Springer
14 years 7 months ago
Aggregating value ranges: preference elicitation and truthfulness
We study the case where agents have preferences over ranges (intervals) of values, and we wish to elicit and aggregate these preferences. For example, consider a set of climatologi...
Joseph Farfel, Vincent Conitzer