2721 search results - page 37 / 545 » An experimental analysis of Lemke-Howson algorithm |
111
click to vote
ACST
2006
14 years 11 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
71
Voted
ICPR
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
ATS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper aims at broadening the scope of hierarchical ATPG to the behavioral-level The main problem of using behavioral information for ATPG is the mismatch of timing models bet...