Sciweavers

88 search results - page 8 / 18
» The Multidimensional Knapsack Problem: Structure and Algorit...
Sort
View
MP
1998
105views more  MP 1998»
13 years 7 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
VLDB
1998
ACM
136views Database» more  VLDB 1998»
13 years 11 months ago
Materialized View Selection for Multidimensional Datasets
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
Amit Shukla, Prasad Deshpande, Jeffrey F. Naughton
BMCBI
2007
104views more  BMCBI 2007»
13 years 7 months ago
Joint mapping of genes and conditions via multidimensional unfolding analysis
Background: Microarray compendia profile the expression of genes in a number of experimental conditions. Such data compendia are useful not only to group genes and conditions base...
Katrijn Van Deun, Kathleen Marchal, Willem J. Heis...
TSP
2010
13 years 2 months ago
Tensor algebra and multidimensional harmonic retrieval in signal processing for MIMO radar
Detection and estimation problems in multiple-input multiple-output (MIMO) radar have recently drawn considerable interest in the signal processing community. Radar has long been a...
Dimitri Nion, Nicholas D. Sidiropoulos
COMPGEOM
2010
ACM
14 years 16 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park