15073 search results - page 405 / 3015 » Probabilistic algorithms for computing resultants |
166
click to vote
RECOMB
2007
Springer
16 years 7 months ago
2007
Springer
Transcription factor (TF) binding to its DNA target site is a fundamental regulatory interaction. The most common model used to represent TF binding specificities is a position spe...
188
click to vote
MM
2005
ACM
16 years 12 days ago
2005
ACM
We propose a new method to measure “visualness” of concepts, that is, what extent concepts have visual characteristics. To know which concept has visually discriminative power...
165
click to vote
SMA
2005
ACM
16 years 12 days ago
2005
ACM
Geometric constraint solving is a key issue in CAD/CAM. Since Owen’s seminal paper, solvers typically use graph based decomposition methods. However, these methods become diffi...
184
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The shrinking generator is a well-known keystream generator composed of two linear feedback shift registers, LFSR1 and LFSR2, where LFSR1 is clock-controlled according to...
171
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...