Sciweavers

3406 search results - page 457 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 10 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
16 years 7 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...
ICCV
2009
IEEE
16 years 11 months ago
A Global Perspective on MAP Inference for Low-Level Vision
In recent years the Markov Random Field (MRF) has become the de facto probabilistic model for low-level vision applications. However, in a maximum a posteriori (MAP) framework, ...
Oliver J. Woodford, Carsten Rother, Vladimir Kolmo...
CCR
2008
88views more  CCR 2008»
15 years 6 months ago
My ten favorite "practical theory" papers
As the saying goes, "In theory there is no difference between theory and practice. But, in practice, there is." Networking research has a wealth of good papers on both s...
Jennifer Rexford
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
16 years 3 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So