Sciweavers

4541 search results - page 399 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
SPAA
2010
ACM
15 years 9 months ago
Flat combining and the synchronization-parallelism tradeoff
Traditional data structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. We introduce a new synchronization paradi...
Danny Hendler, Itai Incze, Nir Shavit, Moran Tzafr...
CIDM
2007
IEEE
15 years 8 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
CEEMAS
2005
Springer
15 years 10 months ago
Selection in Scale-Free Small World
Abstract. In this paper we compare our selection based learning algorithm with the reinforcement learning algorithm in Web crawlers. The task of the crawlers is to find new inform...
Zsolt Palotai, Csilla Farkas, András Lö...
VLSM
2005
Springer
15 years 10 months ago
Heuristically Driven Front Propagation for Geodesic Paths Extraction
In this paper we present a simple modification of the Fast Marching algorithm to speed up the computation using a heuristic. This modification leads to an algorithm that is simil...
Gabriel Peyré, Laurent D. Cohen
NIPS
2004
15 years 6 months ago
Non-Local Manifold Tangent Learning
We claim and present arguments to the effect that a large class of manifold learning algorithms that are essentially local and can be framed as kernel learning algorithms will suf...
Yoshua Bengio, Martin Monperrus