2374 search results - page 38 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
INFOVIS
2002
IEEE
14 years 22 days ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— This paper deals with the optimization of RobotObstacle interaction computations, in the context of nonholonomic trajectory deformation for mobile robots. We first rec...