1778 search results - page 13 / 356 » Local multidimensional scaling |
142
Voted
JCO
2007
15 years 3 months ago
2007
The Multidimensional Assignment Problem (MAP) is an NP-hard combinatorial optimization problem occurring in many applications, such as data association, target tracking, and resou...
136
Voted
EOR
2008
15 years 3 months ago
2008
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...
193
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
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...
231
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
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...
95
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer