Sciweavers

213 search results - page 20 / 43
» A criterion for coarse iterability
Sort
View
HPDC
2002
IEEE
15 years 11 months ago
Multigrain Parallelism for Eigenvalue Computations on Networks of Clusters
Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in ...
James R. McCombs, Andreas Stathopoulos
PRL
2006
139views more  PRL 2006»
15 years 6 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
SIAMMAX
2011
141views more  SIAMMAX 2011»
14 years 9 months ago
Best Low Multilinear Rank Approximation of Higher-Order Tensors, Based on the Riemannian Trust-Region Scheme
Higher-order tensors are used in many application fields, such as statistics, signal processing, and scientific computing. Efficient and reliable algorithms for manipulating thes...
Mariya Ishteva, Pierre-Antoine Absil, Sabine Van H...
ICCV
2003
IEEE
16 years 8 months ago
Regression based Bandwidth Selection for Segmentation using Parzen Windows
We consider the problem of segmentation of images that can be modelled as piecewise continuous signals having unknown, non-stationary statistics. We propose a solution to this pro...
Maneesh Kumar Singh, Narendra Ahuja
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
16 years 18 days ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to “best” represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan