Sciweavers

1871 search results - page 31 / 375
» The Ephemeral Pairing Problem
Sort
View
TIT
1998
89views more  TIT 1998»
14 years 10 months ago
The Common Randomness Capacity of a Pair of Independent Discrete Memoryless Channels
—We study the following problem: two agents Alice and Bob are connected to each other by independent discrete memoryless channels. They wish to generate common randomness, i.e., ...
Sivarama Venkatesan, Venkat Anantharam
CVPR
2011
IEEE
14 years 6 months ago
Single-Image Shadow Detection and Removal using Paired Regions
In this paper, we address the problem of shadow detection and removal from single images of natural scenes. Different from traditional methods that explore pixel or edge informati...
Ruiqi Guo, Qieyun Dai, Derek Hoiem
CADE
2010
Springer
15 years 6 days ago
Decreasing Diagrams and Relative Termination
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
Nao Hirokawa, Aart Middeldorp
SAC
2011
ACM
14 years 1 months ago
ImageAlert: credibility analysis of text-image pairs on the web
Although the Web lets users freely browse and publish information, most Web information is unauthorized in contrast to conventional mass media. Therefore, it is not always credibl...
Yusuke Yamamoto, Katsumi Tanaka
BMCBI
2010
120views more  BMCBI 2010»
14 years 11 months ago
Short clones or long clones? A simulation study on the use of paired reads in metagenomics
Background: Metagenomics is the study of environmental samples using sequencing. Rapid advances in sequencing technology are fueling a vast increase in the number and scope of met...
Suparna Mitra, Max Schubach, Daniel H. Huson