1700 search results - page 135 / 340 » Combinatorial Pattern Matching |
125
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
107
click to vote
CPM
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
146
Voted
CPM
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
129
click to vote
JSS
2007
15 years 1 months ago
2007
A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually of very large size and therefore commonly stored in com...
206
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Existing techniques for schema matching are classified as either schema-based, instance-based, or a combination of both. In this paper, we define a new class of techniques, called ...