509 search results - page 98 / 102 » Lower Bounds for Approximation Algorithms for the Steiner Tr... |
165
Voted
ASIAMS
2007
IEEE
15 years 10 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
144
Voted
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
167
Voted
ICPADS
1994
IEEE
15 years 7 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
128
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
136
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...