Sciweavers

564 search results - page 28 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
15 years 3 months ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
15 years 10 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman
SPIN
2005
Springer
15 years 3 months ago
Repairing Structurally Complex Data
We present a novel algorithm for repairing structurally complex data. Given an assertion that represents desired structural integrity constraints and a structure that violates them...
Sarfraz Khurshid, Iván García, Yuk L...
86
Voted
SIGIR
1996
ACM
15 years 1 months ago
Retrieval of Complex Objects Using a Four-Valued Logic
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
Thomas Rölleke, Norbert Fuhr
110
Voted
BMCBI
2006
122views more  BMCBI 2006»
14 years 9 months ago
Computational reconstruction of transcriptional regulatory modules of the yeast cell cycle
Background: A transcriptional regulatory module (TRM) is a set of genes that is regulated by a common set of transcription factors (TFs). By organizing the genome into TRMs, a liv...
Wei-Sheng Wu, Wen-Hsiung Li, Bor-Sen Chen