Sciweavers

402 search results - page 78 / 81
» A branch and cut algorithm for the Steiner problem in graphs
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 6 months ago
Modeling the structure and evolution of discussion cascades
We analyze the structure and evolution of discussion cascades in four popular websites: Slashdot, Barrapunto, Meneame and Wikipedia. Despite the big heterogeneities between these ...
Vicenç Gómez, Hilbert J. Kappen, And...
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
14 years 1 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
CVPR
2009
IEEE
14 years 5 months ago
Markov Chain Monte Carlo Combined with Deterministic Methods for Markov Random Field Optimization
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
Wonsik Kim (Seoul National University), Kyoung Mu ...
MIR
2010
ACM
191views Multimedia» more  MIR 2010»
13 years 10 months ago
Video retargeting with multi-scale trajectory optimization
Mobile devices are increasingly powerful in media storage and rendering. The prevalent request of decent video browsing on mobile devices is demanding. However, one limitation com...
Yuanning Li, YongHong Tian, Jingjing Yang, Ling-Yu...
CP
2003
Springer
13 years 12 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...