1146 search results - page 46 / 230 » Finite cupping sets |
JCT
2006
13 years 7 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
AGP
1999
IEEE
14 years 1 days ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
NAACL
2003
2003
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
13 years 9 months ago
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
COMBINATORICS
2006
13 years 7 months ago
2006
In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the ...
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...