Sciweavers

1763 search results - page 115 / 353
» Dependent random choice
Sort
View
CSB
2003
IEEE
110views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Prokaryote Phylogeny without Sequence Alignment: From Avoidance Signature to Composition Distance
A new and essentially simple method to reconstruct prokaryotic phylogenetic trees from their complete genome data without using sequence alignment is proposed. It is based on the ...
Bailin Hao, Ji Qi
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
14 years 2 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
CCS
2006
ACM
14 years 1 months ago
Cryptanalysis of the "Grain" family of stream ciphers
Let us have an NLFSR with the feedback function g(x) and an LFSR with the generating polynomial f(x). The function g(x) is a Boolean function on the state of the NLFSR and the LFS...
Alexander Maximov
AAAI
2010
13 years 10 months ago
Truth, Justice, and Cake Cutting
Cake cutting is a common metaphor for the division of a heterogeneous divisible good. There are numerous papers that study the problem of fairly dividing a cake; a small number of...
Yiling Chen, John Lai, David C. Parkes, Ariel D. P...
EUSFLAT
2007
147views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Various Representations and Algebraic Structure of Linear Imprecision Indices
The paper is devoted to the investigation of imprecision indices, introduced in [7]. They are used for evaluation of uncertainty (or more exactly imprecision), which is contained ...
Alexander E. Lepskiy, Andrey G. Bronevich