Sciweavers

28888 search results - page 31 / 5778
» Computability and complexity in analysis
Sort
View
CRYPTO
2007
Springer
133views Cryptology» more  CRYPTO 2007»
14 years 2 months ago
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
We initiate a complexity-theoretic treatment of hardness amplification for collision-resistant hash functions, namely the transformation of weakly collision-resistant hash functio...
Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca T...
SAS
1991
Springer
13 years 11 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
BMCBI
2007
162views more  BMCBI 2007»
13 years 8 months ago
Genome-wide identification of specific oligonucleotides using artificial neural network and computational genomic analysis
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
Chun-Chi Liu, Chin-Chung Lin, Ker-Chau Li, Wen-Shy...
BIRTHDAY
2003
Springer
14 years 1 months ago
Distributed Cooperation and Adversity: Complexity Trade-Offs
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundament...
Chryssis Georgiou, Alexander Russell, Alexander A....
ICALP
2011
Springer
12 years 11 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...