Sciweavers

727 search results - page 108 / 146
» A Calculus of Bounded Capacities
Sort
View
TIT
2010
300views Education» more  TIT 2010»
13 years 4 months ago
Polar codes are optimal for lossy source coding
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
Satish Babu Korada, Rüdiger L. Urbanke
CORR
2011
Springer
239views Education» more  CORR 2011»
13 years 1 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
ICASSP
2011
IEEE
13 years 1 months ago
How many known symbols are required for linear channel estimation in OFDM?
Training sequences for estimation of channel parameters have been well designed under the condition that the number of the unknown channel parameters is not greater than the numbe...
Shuichi Ohno, Emmanuel Manasseh, Masayoshi Nakamot...
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
14 years 3 months ago
Online Bin Packing with Cardinality Constraints
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
Leah Epstein
POPL
2009
ACM
14 years 10 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi