Sciweavers

68 search results - page 9 / 14
» Axiomatization of an exponential similarity function
Sort
View
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 7 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
CODES
2006
IEEE
13 years 11 months ago
Phase guided sampling for efficient parallel application simulation
Simulating chip-multiprocessor systems (CMP) can take a long time. For single-threaded workloads, earlier work has shown the utility of phase analysis, that is identification of r...
Jeffrey Namkung, Dohyung Kim, Rajesh K. Gupta, Igo...
FOCS
1990
IEEE
13 years 11 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
BMCBI
2005
97views more  BMCBI 2005»
13 years 7 months ago
Clustering the annotation space of proteins
Background: Current protein clustering methods rely on either sequence or functional similarities between proteins, thereby limiting inferences to one of these areas. Results: Her...
Victor Kunin, Christos A. Ouzounis
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak