Sciweavers

2150 search results - page 111 / 430
» On a restricted cross-intersection problem
Sort
View
ECCV
2006
Springer
16 years 6 months ago
Fast Memory-Efficient Generalized Belief Propagation
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
M. Pawan Kumar, Philip H. S. Torr
ICPR
2008
IEEE
16 years 5 months ago
Manifold optimisation for motion factorisation
This paper presents a novel formulation for the popular factorisation based solution for Structure from Motion. Since our measurement matrices are populated with incomplete and in...
Appu Shaji, David Suter, Sharat Chandran
ICML
2005
IEEE
16 years 5 months ago
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
H. Brendan McMahan, Maxim Likhachev, Geoffrey J. G...
SIGMOD
2005
ACM
87views Database» more  SIGMOD 2005»
16 years 4 months ago
When Can We Trust Progress Estimators for SQL Queries?
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
Surajit Chaudhuri, Raghav Kaushik, Ravishankar Ram...
RECOMB
2009
Springer
15 years 11 months ago
Counting All DCJ Sorting Scenarios
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
Marília D. V. Braga, Jens Stoye