Sciweavers

19 search results - page 3 / 4
» Nearly Optimal Expected-Case Planar Point Location
Sort
View
HEURISTICS
1998
103views more  HEURISTICS 1998»
13 years 5 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
CDC
2009
IEEE
132views Control Systems» more  CDC 2009»
13 years 10 months ago
Optimal sensor placement for time difference of arrival localization
— This paper addresses the problem of localizing a source from noisy time-of-arrival measurements. In particular, we are interested in the optimal placement of M planar sensors s...
Jason T. Isaacs, Daniel J. Klein, João Pedr...
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 6 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
SIAMDM
2010
149views more  SIAMDM 2010»
13 years 4 months ago
Formal Theory of Noisy Sensor Network Localization
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...
Brian D. O. Anderson, Iman Shames, Guoqiang Mao, B...
CVPR
2008
IEEE
14 years 7 days ago
Retinal image registration from 2D to 3D
We propose a 2D registration method for multi-modal image sequences of the retinal fundus, and a 3D metric reconstruction of near planar surface from multiple views. There are two...
Yuping Lin, Gérard G. Medioni