Sciweavers

331 search results - page 60 / 67
» New Results on the Pseudorandomness of Some Blockcipher Cons...
Sort
View
STACS
2001
Springer
14 years 8 days ago
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
David Janin, Jerzy Marcinkowski
CHARME
2003
Springer
110views Hardware» more  CHARME 2003»
13 years 11 months ago
Exact and Efficient Verification of Parameterized Cache Coherence Protocols
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...
E. Allen Emerson, Vineet Kahlon
BMCBI
2006
201views more  BMCBI 2006»
13 years 8 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
BMCBI
2006
112views more  BMCBI 2006»
13 years 8 months ago
Protein disorder prediction by condensed PSSM considering propensity for order or disorder
Background: More and more disordered regions have been discovered in protein sequences, and many of them are found to be functionally significant. Previous studies reveal that dis...
Chung-Tsai Su, Chien-Yu Chen, Yu-Yen Ou
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...