Sciweavers

4137 search results - page 140 / 828
» On the number of matchings of a tree
Sort
View
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 12 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
WISE
2005
Springer
16 years 2 days ago
NET - A System for Extracting Web Data from Flat and Nested Data Records
This paper studies automatic extraction of structured data from Web pages. Each of such pages may contain several groups of structured data records. Existing automatic methods stil...
Bing Liu, Yanhong Zhai
IADIS
2003
15 years 7 months ago
Generating Guided Tours over Indexed Information Resources
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
Benjamin Buffereau, Pierre Duchet, Philippe Picoue...
ACS
2008
15 years 6 months ago
Subobject Transformation Systems
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
Andrea Corradini, Frank Hermann, Pawel Sobocinski
CG
2002
Springer
15 years 6 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant