6575 search results - page 236 / 1315 » Specializing visualization algorithms |
182
click to vote
JDA
2006
15 years 6 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
197
click to vote
NETWORKS
2008
15 years 6 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
141
click to vote
PAMI
2008
15 years 6 months ago
2008
In this paper, we develop a new effective multiple kernel learning algorithm. First, we map the input data into m different feature spaces by m empirical kernels, where each genera...
183
click to vote
TIT
2002
15 years 6 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
163
click to vote
TON
2002
15 years 6 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...