2654 search results - page 76 / 531 » On Pairing Inversion Problems |
147
click to vote
TIT
1998
15 years 4 months ago
1998
—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., ...
160
click to vote
CVPR
2011
IEEE
14 years 12 months ago
2011
IEEE
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...
118
click to vote
CADE
2010
Springer
15 years 5 months ago
2010
Springer
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...
128
click to vote
PR
2002
15 years 4 months ago
2002
7 Major problems exist in both crisp and fuzzy clustering algorithms. The fuzzy c-means type of algorithms use weights determined by a power m of inverse distances that remains
144
click to vote
SAC
2011
ACM
14 years 7 months ago
2011
ACM
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...