2796 search results - page 483 / 560 » The coolest path problem |
137
click to vote
ICAI
2007
15 years 6 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
124
click to vote
NIPS
2008
15 years 6 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
154
click to vote
VMV
2001
15 years 6 months ago
2001
Manipulation of high-precision voxel volume at interactive speed is still not immediately possible by known algorithms on today's workstation hardware. We propose to decompos...
232
click to vote
WSC
2004
15 years 6 months ago
2004
Decision trees are one of the most easy to use tools in decision analysis. Problems where decision tree branches are based on random variables have not received much attention. Th...
146
click to vote
WSC
2004
15 years 6 months ago
2004
Homeland defense applications will use large-scale ad-hoc networks of small devices. Routing is a crucial problem, for naive means do not scale well. Geographic Routing (GR) (Karp...