430 search results - page 25 / 86 » A New Linearizing Restriction in the Pattern Matching Proble... |
125
click to vote
ALGORITHMICA
2006
15 years 3 months ago
2006
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
108
click to vote
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
Solving non-linear distortion problems in fingerprint matching is important and still remains as a challenging topic. We have developed a new fingerprint matching method to deal w...
121
click to vote
ACSC
2006
IEEE
15 years 9 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
142
click to vote
IANDC
2011
14 years 10 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
146
click to vote
CONSTRAINTS
1999
15 years 2 months ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...