Sciweavers

10988 search results - page 99 / 2198
» Algorithmic Folding Complexity
Sort
View
ANCS
2009
ACM
15 years 7 days ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
BMCBI
2010
101views more  BMCBI 2010»
15 years 2 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly
114
Voted
COCO
2000
Springer
107views Algorithms» more  COCO 2000»
15 years 6 months ago
On the Complexity of Intersecting Finite State Automata
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
George Karakostas, Richard J. Lipton, Anastasios V...
DMTCS
2003
93views Mathematics» more  DMTCS 2003»
15 years 3 months ago
Two Philosophical Applications of Algorithmic Information Theory
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...
Gregory J. Chaitin
GLOBECOM
2006
IEEE
15 years 8 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans