567 search results - page 38 / 114 » Exact train pathing |
ACL
2004
15 years 1 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
IPPS
1994
IEEE
15 years 4 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
102
click to vote
CSR
2009
Springer
15 years 6 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
ICPR
2000
IEEE
15 years 4 months ago
2000
IEEE
This article deals with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of ...