2124 search results - page 252 / 425 » Aggregating time partitions |
152
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
167
click to vote
DAM
2008
15 years 6 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
133
click to vote
DISOPT
2008
15 years 6 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
196
click to vote
IVC
2008
15 years 6 months ago
2008
We present a method for efficiently generating a representation of a multi-modal posterior probability distribution. The technique combines ideas from RANSAC and particle filterin...
164
click to vote
ISCI
2007
15 years 6 months ago
2007
This paper examines a decision-tree framework for instance-space decomposition. According to the framework, the original instance-space is hierarchically partitioned into multiple...