Sciweavers

773 search results - page 155 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
12 years 12 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
CVPR
2012
IEEE
12 years 12 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
121
Voted
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
12 years 12 months ago
Simplex Distributions for Embedding Data Matrices over Time
Early stress recognition is of great relevance in precision plant protection. Pre-symptomatic water stress detection is of particular interest, ultimately helping to meet the chal...
Kristian Kersting, Mirwaes Wahabzada, Christoph R&...