7150 search results - page 1400 / 1430 » An Approximation Algorithm for Approximation Rank |
125
click to vote
TAMC
2009
Springer
15 years 5 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
98
Voted
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...
110
click to vote
HPDC
2000
IEEE
15 years 4 months ago
2000
IEEE
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...
103
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
112
Voted
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
Many researchers have been arguing that geometry, bump maps, and BRDFs present a hierarchy of detail that should be exploited for efficient rendering purposes. In practice howeve...