16430 search results - page 303 / 3286 » On Computable Tree Functions |
168
click to vote
ACPC
1999
Springer
15 years 9 months ago
1999
Springer
Multi-resolution methods are widely used in scientific visualization, image processing, and computer graphics. While many applications only require an one-time construction of the...
120
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
150
click to vote
ACG
2009
Springer
15 years 11 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
114
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a novel protocol for restructuring a treebased overlay network in response to the workload of the application running over it. Through low-cost restructuring operations...
153
click to vote
LCN
2002
IEEE
15 years 9 months ago
2002
IEEE
A novel efficiency and effectiveness Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicas...