2194 search results - page 144 / 439 » Improving HLRTA*( k ) |
112
click to vote
ICIP
1999
IEEE
16 years 3 months ago
1999
IEEE
The vast majority of copied documents generally consist of text, and the copy quality mostly depends on the text's reproduction quality. A new technique to enhance dark text ...
113
click to vote
MOBIHOC
2009
ACM
16 years 2 months ago
2009
ACM
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...
139
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
128
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
122
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...