Sciweavers

AHSWN
2010
102views more  AHSWN 2010»
14 years 3 hour ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...
FLAIRS
2008
14 years 28 days ago
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
Federico Heras, Vasco M. Manquinho, João Ma...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 29 days ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
ACL
1992
14 years 1 months ago
Estimating Upper and Lower Bounds on the Performance of Word-Sense Disambiguation Programs
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
William A. Gale, Kenneth Ward Church, David Yarows...
NIPS
1996
14 years 1 months ago
Reconstructing Stimulus Velocity from Neuronal Responses in Area MT
We employed a white-noise velocity signal to study the dynamics of the response of single neurons in the cortical area MT to visual motion. Responses were quantified using reverse...
Wyeth Bair, James R. Cavanaugh, J. Anthony Movshon
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
14 years 1 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
14 years 1 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
SSWMC
2004
14 years 1 months ago
Steganalysis of block-structured stegotext
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...
Ying Wang, Pierre Moulin
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
14 years 1 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff