Sciweavers

370 search results - page 36 / 74
» Independent Sets with Domination Constraints
Sort
View
ICDE
1996
IEEE
124views Database» more  ICDE 1996»
16 years 3 months ago
Automating the Assembly of Presentations from Multimedia Databases
A multimedia presentation refers to the presentation of multimedia data using output devices such as monitors for text and video, and speakers for audio. Each presentation consist...
Gultekin Özsoyoglu, Joel Kraft, Veli Hakkoyma...
ICML
2007
IEEE
16 years 2 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
104
Voted
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
15 years 11 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
JMLR
2010
119views more  JMLR 2010»
14 years 8 months ago
Factorized Orthogonal Latent Spaces
Existing approaches to multi-view learning are particularly effective when the views are either independent (i.e, multi-kernel approaches) or fully dependent (i.e., shared latent ...
Mathieu Salzmann, Carl Henrik Ek, Raquel Urtasun, ...
126
Voted
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 5 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...