Sciweavers

582 search results - page 107 / 117
» What Will Probably Happen
Sort
View
IPL
2007
72views more  IPL 2007»
13 years 7 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
TIT
2008
95views more  TIT 2008»
13 years 7 months ago
Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels
In modern communication systems, different users have different requirements for quality of service (QoS). In this work, QoS refers to the average codeword error probability experi...
Lihua Weng, S. Sandeep Pradhan, Achilleas Anastaso...
JOCN
2010
105views more  JOCN 2010»
13 years 6 months ago
Brain Structures Involved in Visual Search in the Presence and Absence of Color Singletons
■ It is still debated to what degree top–down and bottom–up driven attentional control processes are subserved by shared or by separate mechanisms. Interactions between thes...
Durk Talsma, Brian Coe, Douglas P. Munoz, Jan Thee...
JCSS
2008
120views more  JCSS 2008»
13 years 7 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel