Sciweavers

162 search results - page 13 / 33
» rules 1997
Sort
View
95
Voted
ACL
1997
15 years 1 months ago
String Transformation Learning
String transformation systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computational proble...
Giorgio Satta, John C. Henderson
VLDB
1997
ACM
97views Database» more  VLDB 1997»
15 years 4 months ago
The Complexity of Transformation-Based Join Enumeration
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
Arjan Pellenkoft, César A. Galindo-Legaria,...
FM
1997
Springer
159views Formal Methods» more  FM 1997»
15 years 4 months ago
Term Rewrite Systems to Derive Set Boolean Operations on 2D Objects
Abstract Set boolean operations between 2-dlmensional geometric objects are crucial in computational geometry and deserve rigorous treatments. We build up a simple and convergent s...
David Cazier, Jean-François Dufourd
59
Voted
JOS
2011
59views more  JOS 2011»
14 years 7 months ago
The problem of the initial transient (again), or why MSER works
In a comprehensive study of methods for dealing with the problem of the initial transient, Hoad et al. (2008) determined that the MSER (White, 1997) was an efficient and effective...
K. P. White Jr., S. Robinson
ADL
1997
Springer
125views Digital Library» more  ADL 1997»
15 years 4 months ago
Error Tolerant Document Structure Analysis
Successful applications of digital libraries require structured access to sources of information. This paper presents an approach to extract the logical structure of text document...
Bertin Klein, Peter Fankhauser