Sciweavers

520 search results - page 70 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
COMPGEOM
2008
ACM
15 years 2 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
102
Voted
AINA
2009
IEEE
15 years 7 months ago
Predictive Simulation of HPC Applications
The architectures which support modern supercomputing machinery are as diverse today, as at any point during the last twenty years. The variety of processor core arrangements, thr...
Simon D. Hammond, J. A. Smith, Gihan R. Mudalige, ...
123
Voted
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 20 days ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin

Publication
4052views
17 years 1 months ago
On the Extraction of Curve Skeletons using Gradient Vector Flow
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation. We have...
M. Sabry Hassouna, Aly A. Farag
108
Voted
JAIR
2000
152views more  JAIR 2000»
15 years 9 days ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht