Sciweavers

1046 search results - page 57 / 210
» Approximation Algorithms for Domination Search
Sort
View
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
15 years 7 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
132
Voted
GIS
2010
ACM
15 years 1 months ago
Supporting location-based approximate-keyword queries
Many Web sites support keyword search on their spatial data, such as business listings and photos. In these systems, inconsistencies and errors can exist in both queries and the d...
Sattam Alsubaiee, Alexander Behm, Chen Li
132
Voted
CIKM
2006
Springer
15 years 6 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
EDBT
2006
ACM
182views Database» more  EDBT 2006»
16 years 2 months ago
On High Dimensional Skylines
In many decision-making applications, the skyline query is frequently used to find a set of dominating data points (called skyline points) in a multidimensional dataset. In a high-...
Chee Yong Chan, H. V. Jagadish, Kian-Lee Tan, Anth...
104
Voted
ICPR
2010
IEEE
15 years 14 days ago
Efficient Polygonal Approximation of Digital Curves via Monte Carlo Optimization
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
Xiuzhuang Zhou, Yao Lu