Sciweavers

18451 search results - page 378 / 3691
» Selecting a Selection Procedure
Sort
View
COR
2008
88views more  COR 2008»
15 years 6 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 6 months ago
Dynamic index selection in data warehouses
Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response...
Stéphane Azefack, Kamel Aouiche, Jér...
DKE
2008
72views more  DKE 2008»
15 years 6 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 6 months ago
On the User Selection for MIMO Broadcast Channels
1 In this paper, we consider a downlink communication system, in which a base station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas....
Alireza Bayesteh, Amir K. Khandani
CORR
2006
Springer
103views Education» more  CORR 2006»
15 years 6 months ago
Expressing Security Properties Using Selective Interleaving Functions
McLean's notion of Selective Interleaving Functions (SIFs) is perhaps the bestknown attempt to construct a framework for expressing various security properties. We examine th...
Joseph Y. Halpern, Sabina Petride