Sciweavers

516 search results - page 53 / 104
» Sets of k-Independent Strings
Sort
View
LICS
2008
IEEE
14 years 3 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
14 years 2 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang
FPL
2005
Springer
137views Hardware» more  FPL 2005»
14 years 2 months ago
Bitwise Optimised CAM for Network Intrusion Detection Systems
String pattern matching is a computationally expensive task, and when implemented in hardware, it can consume a large amount of resources for processing and storage. This paper pr...
Sherif Yusuf, Wayne Luk
ICCS
2004
Springer
14 years 2 months ago
An Exportable CGIF Module from the CP Environment: A Pragmatic Approach
We have upgraded the Conceptual Programming Environment (CP) from a single standalone application to a set of component modules to increase flexibility of the environment and to a...
Heather D. Pfeiffer
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 1 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...