Sciweavers

326 search results - page 21 / 66
» Closing the Gap
Sort
View
COLT
2005
Springer
15 years 5 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed ā€œmanifold-motivatedā€...
Mikhail Belkin, Partha Niyogi
COLT
2005
Springer
15 years 5 months ago
From Graphs to Manifolds - Weak and Strong Pointwise Consistency of Graph Laplacians
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
HUC
2004
Springer
15 years 5 months ago
Rapid Authoring of Mediascapes
Ubiquitous computing promises to enable new classes of application. In this paper, we present research intended to accelerate the exploration of the space of possible application ...
Richard Hull 0002, Ben J. C. Clayton, Tom Melamed
CC
2003
Springer
126views System Software» more  CC 2003»
15 years 5 months ago
Offset Assignment Showdown: Evaluation of DSP Address Code Optimization Algorithms
Abstract. Offset assignment is a highly effective DSP address code optimization technique that has been implemented in a number of ANSI C compilers. In this paper we concentrate on...
Rainer Leupers
EUROPAR
2001
Springer
15 years 4 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci