Sciweavers

545 search results - page 15 / 109
» Simultaneous approximation by greedy algorithms
Sort
View
ICDE
2006
IEEE
176views Database» more  ICDE 2006»
14 years 9 months ago
Mondrian Multidimensional K-Anonymity
K-Anonymity has been proposed as a mechanism for protecting privacy in microdata publishing, and numerous recoding "models" have been considered for achieving kanonymity...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...
RAS
2006
123views more  RAS 2006»
13 years 8 months ago
Planning exploration strategies for simultaneous localization and mapping
In this paper, we present techniques that allow one or multiple mobile robots to efficiently explore and model their environment. While much existing research in the area of Simul...
Benjamín Tovar, Lourdes Muñoz-G&oacu...
EWC
2010
112views more  EWC 2010»
13 years 7 months ago
Meshing volumes with curved boundaries
Abstract This paper introduces a three-dimensional mesh generation algorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines ...
Steve Oudot, Laurent Rineau, Mariette Yvinec
CP
2008
Springer
13 years 10 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
IPPS
2009
IEEE
14 years 3 months ago
Multi-users scheduling in parallel systems
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
Erik Saule, Denis Trystram