11212 search results - page 1847 / 2243 » Semi-persistent Data Structures |
169
Voted
APN
2004
Springer
15 years 11 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
144
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
145
click to vote
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. A method for quantitative assessment of tree structures is reported allowing evaluation of airway tree morphology and its associated function. Our skeletonization and bra...
136
Voted
EUROGP
2004
Springer
15 years 11 months ago
2004
Springer
Parsing and Tagging are very important tasks in Natural Language Processing. Parsing amounts to searching the correct combination of grammatical rules among those compatible with a...
164
Voted
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...