Sciweavers

2181 search results - page 123 / 437
» The restriction scaffold problem
Sort
View
59
Voted
ICPR
2008
IEEE
16 years 1 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
94
Voted
ICML
2005
IEEE
16 years 1 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...
166
Voted
SIGMOD
2005
ACM
87views Database» more  SIGMOD 2005»
16 years 25 days 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...
115
Voted
RECOMB
2009
Springer
15 years 7 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
91
Voted
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
15 years 7 months ago
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard
We consider the problem of coloring a grid using k colors with the restriction that in each row and each column has an specific number of cells of each color. In an already classi...
Christoph Dürr, Flavio Guiñez, Mart&ia...