Sciweavers

164 search results - page 33 / 33
» Improved upper bounds on sizes of codes
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 5 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
TWC
2008
99views more  TWC 2008»
13 years 5 months ago
Robust transmit processing for frequency-selective fading channels with imperfect channel feedback
Reliable channel state information at the transmitter (CSIT) can improve the throughput of wireless networks significantly. In a realistic scenario, there is a mismatch between th...
Christof Jonietz, Wolfgang H. Gerstacker, Robert S...
CASES
2010
ACM
13 years 3 months ago
Low cost multicast authentication via validity voting in time-triggered embedded control networks
Wired embedded networks must include multicast authentication to prevent masquerade attacks within the network. However, unique constraints for these networks make most existing m...
Christopher Szilagyi, Philip Koopman
VLDB
2004
ACM
126views Database» more  VLDB 2004»
13 years 10 months ago
STEPS towards Cache-resident Transaction Processing
Online transaction processing (OLTP) is a multibillion dollar industry with high-end database servers employing state-of-the-art processors to maximize performance. Unfortunately,...
Stavros Harizopoulos, Anastassia Ailamaki