Sciweavers

4536 search results - page 415 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
AAAI
2006
15 years 8 months ago
Automatic Wrapper Generation Using Tree Matching and Partial Tree Alignment
This paper is concerned with the problem of structured data extraction from Web pages. The objective of the research is to automatically segment data records in a page, extract da...
Yanhong Zhai, Bing Liu
SPAA
2010
ACM
15 years 11 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 11 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
16 years 13 days 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
16 years 11 days 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