Sciweavers

8294 search results - page 1409 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
JAIR
2006
179views more  JAIR 2006»
15 years 4 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
SADM
2008
178views more  SADM 2008»
15 years 3 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
TVCG
2012
213views Hardware» more  TVCG 2012»
13 years 6 months ago
Mesh-Driven Vector Field Clustering and Visualization: An Image-Based Approach
—Vector field visualization techniques have evolved very rapidly over the last two decades, however, visualizing vector fields on complex boundary surfaces from computational ...
Zhenmin Peng, Edward Grundy, Robert S. Laramee, Gu...
ICA
2010
Springer
15 years 2 months ago
Second Order Subspace Analysis and Simple Decompositions
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
Harold W. Gutch, Takanori Maehara, Fabian J. Theis
ICSNC
2007
IEEE
15 years 10 months ago
Movement Prediction Using Bayesian Learning for Neural Networks
Nowadays, path prediction is being extensively examined for use in the context of mobile and wireless computing towards more efficient network resource management schemes. Path pr...
Sherif Akoush, Ahmed Sameh
« Prev « First page 1409 / 1659 Last » Next »