Sciweavers

221 search results - page 9 / 45
» The cost of not knowing the radius
Sort
View
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
14 years 2 months ago
The Oil Searching Problem
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. ...
Andrew McGregor, Krzysztof Onak, Rina Panigrahy
CVPR
2010
IEEE
14 years 3 months ago
3D Shape Correspondence by Isometry-Driven Greedy Optimization
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...
Yusuf Sahillioglu, Yucel Yemez
ADHOC
2007
101views more  ADHOC 2007»
13 years 7 months ago
Searching strategies for target discovery in wireless networks
— In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In o...
Zhao Cheng, Wendi B. Heinzelman
PVLDB
2010
100views more  PVLDB 2010»
13 years 2 months ago
Efficient Proximity Detection among Mobile Users via Self-Tuning Policies
Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean...
Man Lung Yiu, Leong Hou U, Simonas Saltenis, Kosta...
ICDE
2008
IEEE
219views Database» more  ICDE 2008»
14 years 8 months ago
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
Preserving individual privacy when publishing data is a problem that is receiving increasing attention. According to the k-anonymity principle, each release of data must be such th...
Osman Abul, Francesco Bonchi, Mirco Nanni