743 search results - page 127 / 149 » Approximation Algorithms for Graph Homomorphism Problems |
112
Voted
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
128
Voted
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
125
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
123
click to vote
PERCOM
2010
ACM
15 years 17 days ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...
105
Voted
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...