Sciweavers

305 search results - page 19 / 61
» From Sets to Bits in Coq
Sort
View
SIGIR
2002
ACM
14 years 10 months ago
Analysis of papers from twenty-five years of SIGIR conferences: what have we been doing for the last quarter of a century?
mes, abstracts and year of publication of all 853 papers published.1 We then applied Porter stemming and stopword removal to this text, represented terms from the elds with twice t...
Alan F. Smeaton, Gary Keogh, Cathal Gurrin, Kieran...
ICASSP
2010
IEEE
14 years 11 months ago
Circulant space-time codes for integration with beamforming
—This paper provides a framework for designing space-time codes to take advantage of a small number of feedback bits from the receiver. The new codes are based on circulant matri...
Yiyue Wu, A. Robert Calderbank
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
15 years 4 months ago
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
Mohammad Hossain Heydari, Linda Morales, Ivan Hal ...
ICMCS
2006
IEEE
145views Multimedia» more  ICMCS 2006»
15 years 4 months ago
Confronting the Synchronization Problem of Semantic Region Under Geometric Attacks
In this paper, an affine invariant watermarking scheme, robust to geometric attacks, is proposed and applied to face regions. Initially, face regions are unsupervisedly extracted ...
Paraskevi K. Tzouveli, Klimis S. Ntalianis, Stefan...
PODC
2009
ACM
15 years 11 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan