Sciweavers

1778 search results - page 13 / 356
» Local multidimensional scaling
Sort
View
JCO
2007
123views more  JCO 2007»
15 years 9 days ago
On the number of local minima for the multidimensional assignment problem
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
Don A. Grundel, Pavlo A. Krokhmal, Carlos A. S. Ol...
EOR
2008
79views more  EOR 2008»
15 years 14 days ago
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a wellknown (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upp...
Konstantinos Kaparis, Adam N. Letchford
166
Voted
ICDE
2007
IEEE
116views Database» more  ICDE 2007»
16 years 1 months ago
MultiMap: Preserving disk locality for multidimensional datasets
MultiMap is an algorithm for mapping multidimensional datasets so as to preserve the data's spatial locality on disks. Without revealing disk-specific details to applications...
Minglong Shao, Steven W. Schlosser, Stratos Papado...
201
Voted
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
16 years 1 months ago
On Multidimensional k-Anonymity with Local Recoding Generalization
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a kanonymous table with quality guarantee. First, we prove that it is NP-h...
Yang Du, Tian Xia, Yufei Tao, Donghui Zhang, Feng ...
71
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
Local Search Heuristics for the Multidimensional Assignment Problem
Gregory Gutin, Daniel Karapetyan