Sciweavers

150 search results - page 29 / 30
» Fast Unimodular Counting
Sort
View
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 7 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
AAAI
2006
13 years 7 months ago
When Gossip is Good: Distributed Probabilistic Inference for Detection of Slow Network Intrusions
Intrusion attempts due to self-propagating code are becoming an increasingly urgent problem, in part due to the homogeneous makeup of the internet. Recent advances in anomalybased...
Denver Dash, Branislav Kveton, John Mark Agosta, E...
BMCBI
2007
166views more  BMCBI 2007»
13 years 5 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...
CCR
2007
119views more  CCR 2007»
13 years 5 months ago
Exploiting KAD: possible uses and misuses
Peer-to-peer systems have seen a tremendous growth in the last few years and peer-to-peer traffic makes a major fraction of the total traffic seen in the Internet. The dominating ...
Moritz Steiner, Taoufik En-Najjary, Ernst W. Biers...
MICRO
2007
IEEE
113views Hardware» more  MICRO 2007»
13 years 5 months ago
The High Cost of a Cheap Lesson
y abstract, it is grounded in the experience of many markets. As I will illustrate, it explains much strategic behavior. Information spreads With a bit of effort, any technically s...
Shane Greenstein