Sciweavers

1389 search results - page 244 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
KDD
2010
ACM
286views Data Mining» more  KDD 2010»
14 years 8 months ago
Nonnegative shared subspace learning and its application to social media retrieval
Although tagging has become increasingly popular in online image and video sharing systems, tags are known to be noisy, ambiguous, incomplete and subjective. These factors can ser...
Sunil Kumar Gupta, Dinh Q. Phung, Brett Adams, Tru...
SIAMIS
2010
378views more  SIAMIS 2010»
14 years 4 months ago
Global Interactions in Random Field Models: A Potential Function Ensuring Connectedness
Markov random field (MRF) models, including conditional random field models, are popular in computer vision. However, in order to be computationally tractable, they are limited to ...
Sebastian Nowozin, Christoph H. Lampert
ICCV
2011
IEEE
13 years 10 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 10 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
APPROX
2009
Springer
99views Algorithms» more  APPROX 2009»
15 years 4 months ago
Resource Minimization Job Scheduling
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
Julia Chuzhoy, Paolo Codenotti