Sciweavers

3020 search results - page 28 / 604
» Optimal partition trees
Sort
View
AAAI
2010
15 years 5 months ago
Symbolic Dynamic Programming for First-order POMDPs
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...
Scott Sanner, Kristian Kersting
176
Voted
CVPR
2012
IEEE
13 years 6 months ago
Parameter-free/Pareto-driven procedural 3D reconstruction of buildings from ground-level sequences
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
Loïc Simon, Olivier Teboul, Panagiotis Koutso...
96
Voted
PODS
2005
ACM
115views Database» more  PODS 2005»
16 years 3 months ago
A divide-and-merge methodology for clustering
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
David Cheng, Santosh Vempala, Ravi Kannan, Grant W...
125
Voted
ACTA
2008
88views more  ACTA 2008»
15 years 2 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
HIPC
1999
Springer
15 years 7 months ago
Memory-Optimal Evaluation of Expression Trees Involving Large Objects
The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects a...
Chi-Chung Lam, Daniel Cociorva, Gerald Baumgartner...