Sciweavers

1629 search results - page 229 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CHES
2006
Springer
137views Cryptology» more  CHES 2006»
15 years 1 months ago
Provably Secure S-Box Implementation Based on Fourier Transform
Cryptographic algorithms implemented in embedded devices must withstand Side Channel Attacks such as the Differential Power Analysis (DPA). A common method of protecting symmetric ...
Emmanuel Prouff, Christophe Giraud, Sébasti...
TIT
2008
76views more  TIT 2008»
14 years 9 months ago
A Quasi-Random Approach to Space-Time Codes
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
Keying Y. Wu, Li Ping
ACL
2010
14 years 8 months ago
Hierarchical Search for Word Alignment
We present a simple yet powerful hierarchical search algorithm for automatic word alignment. Our algorithm induces a forest of alignments from which we can efficiently extract a r...
Jason Riesa, Daniel Marcu
ICDT
2009
ACM
166views Database» more  ICDT 2009»
15 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ISCA
2009
IEEE
161views Hardware» more  ISCA 2009»
15 years 4 months ago
AnySP: anytime anywhere anyway signal processing
In the past decade, the proliferation of mobile devices has increased at a spectacular rate. There are now more than 3.3 billion active cell phones in the world—a device that we...
Mark Woh, Sangwon Seo, Scott A. Mahlke, Trevor N. ...