5169 search results - page 374 / 1034 » Locality approximation using time |
209
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
166
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The Border Gateway Protocol (BGP) handles the task of establishing routes between the Autonomous Systems (ASes) that make up the Internet. It is known that it is possible for a ...
233
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
156
click to vote
DCG
1998
15 years 6 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
182
click to vote
ICANN
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...