Sciweavers

536 search results - page 62 / 108
» The hardness and approximation algorithms for l-diversity
Sort
View
IGARSS
2010
13 years 2 months ago
Calibrating probabilities for hyperspectral classification of rock types
This paper investigates the performance of machine learning methods for classifying rock types from hyperspectral data. The main objective is to test the impact on classification ...
Sildomar T. Monteiro, Richard J. Murphy
STOC
2010
ACM
185views Algorithms» more  STOC 2010»
14 years 15 hour ago
Measuring independence of datasets
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...
Vladimir Braverman, Rafail Ostrovsky
GECCO
2010
Springer
248views Optimization» more  GECCO 2010»
13 years 11 months ago
Integrating decision space diversity into hypervolume-based multiobjective search
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
Tamara Ulrich, Johannes Bader, Eckart Zitzler
ICALP
2009
Springer
14 years 8 months ago
Improved Bounds for Flow Shop Scheduling
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
Monaldo Mastrolilli, Ola Svensson
MOBIHOC
2006
ACM
14 years 7 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...