667 search results - page 106 / 134 » Approximation algorithms for connected facility location pro... |
NIPS
1996
15 years 1 months ago
1996
A central theme of computational vision research has been the realization that reliable estimation of local scene properties requires propagating measurements across the image. Ma...
171
click to vote
JPDC
2007
15 years 10 days ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
109
Voted
MOBIHOC
2005
ACM
16 years 1 days ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
136
click to vote
ASIAMS
2007
IEEE
15 years 6 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...
101
Voted
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...