Sciweavers

356 search results - page 22 / 72
» A computational approach to negative priming
Sort
View
IJIT
2004
13 years 8 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
FCT
2005
Springer
14 years 28 days ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
13 years 11 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu
ITICSE
2006
ACM
14 years 1 months ago
ASSISTing CS1 students to learn: learning approaches and object-oriented programming
Identifying and managing students who experience difficulty with learning to program is a challenge for CS educators. In an attempt to answer the familiar question “What makes f...
Janet Hughes, D. Ramanee Peiris
DCC
2007
IEEE
14 years 7 months ago
Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
Let p be a prime and let E(IFp) be an elliptic curve defined over the finite field IFp of p elements. For a given point G E(IFp) the linear congruential genarator on elliptic curv...
Jaime Gutierrez, Álvar Ibeas