2095 search results - page 140 / 419 » Improved pebbling bounds |
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is propo...
154
click to vote
DAM
2006
15 years 6 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
187
click to vote
DM
2002
15 years 6 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
154
click to vote
TIT
2002
15 years 6 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
264
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— We present a novel algorithm to perform continuous collision detection(CCD) between non-rigid, deformable models using local advancement. Given the initial and final c...