Sciweavers

574 search results - page 94 / 115
» On the Validity of Hierarchical Decompositions
Sort
View
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
14 years 1 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh
COMPGEOM
2010
ACM
14 years 20 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
AGENTS
1998
Springer
13 years 11 months ago
A Hybrid Procedural/Deductive Executive for Autonomous Spacecraft
The New Millennium Remote Agent NMRA will be the rst AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic reco...
Barney Pell, Edward B. Gamble, Erann Gat, Ron Kees...
JAIR
2006
179views more  JAIR 2006»
13 years 7 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
CGF
2000
174views more  CGF 2000»
13 years 7 months ago
Multiresolution shape deformations for meshes with dynamic vertex connectivity
Multiresolution shape representation is a very effective way to decompose surface geometry into several levels of detail. Geometric modeling with such representations enables flex...
Leif Kobbelt, Thilo Bareuther, Hans-Peter Seidel