Sciweavers

696 search results - page 93 / 140
» A class of combinatorial identities
Sort
View
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
16 years 3 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen
CVPR
2010
IEEE
16 years 2 months ago
Discriminative Clustering for Image Co-segmentation
Purely bottom-up, unsupervised segmentation of a single image into two segments remains a challenging task for computer vision. The co-segmentation problem is the process of joi...
Armand Joulin, Francis Bach, Jean Ponce
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
16 years 28 days ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...
INFOCOM
2009
IEEE
16 years 28 days ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
SAGT
2009
Springer
108views Game Theory» more  SAGT 2009»
16 years 24 days ago
On the Planner's Loss Due to Lack of Information in Bayesian Mechanism Design
In this paper we study a large class of resource allocation problems with an important complication, the utilization cost of a given resource is private information of a profit ma...
José R. Correa, Nicolas Figueroa