Sciweavers

1225 search results - page 13 / 245
» The Instance Complexity Conjecture
Sort
View
ICALP
2010
Springer
14 years 13 days ago
SDP Gaps for 2-to-1 and Other Label-Cover Variants
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell...
ALENEX
2010
143views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Navigation in Real-World Complex Networks through Embedding in Latent Spaces
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
Xiaomeng Ban, Jie Gao, Arnout van de Rijt
DCG
2008
77views more  DCG 2008»
13 years 7 months ago
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
Eran Nevo
ICTAI
2010
IEEE
13 years 5 months ago
Instance-Based Ensemble Pruning via Multi-Label Classification
Ensemble pruning is concerned with the reduction of the size of an ensemble prior to its combination. Its purpose is to reduce the space and time complexity of the ensemble and/or ...
Fotini Markatopoulou, Grigorios Tsoumakas, Ioannis...
ECMDAFA
2009
Springer
109views Hardware» more  ECMDAFA 2009»
14 years 2 months ago
Uniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
Alix Mougenot, Alexis Darrasse, Xavier Blanc, Mich...