Sciweavers

204 search results - page 28 / 41
» Parallel Structured Duplicate Detection
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 9 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
ICIAR
2004
Springer
15 years 11 months ago
Face Class Modeling Using Mixture of SVMs
We 1 present a method for face detection which uses a new SVM structure trained in an expert manner in the eigenface space. This robust method has been introduced as a post process...
Julien Meynet, Vlad Popovici, Jean-Philippe Thiran
MLMI
2004
Springer
15 years 11 months ago
Mixture of SVMs for Face Class Modeling
We 1 present a method for face detection which uses a new SVM structure trained in an expert manner in the eigenface space. This robust method has been introduced as a post process...
Julien Meynet, Vlad Popovici, Jean-Philippe Thiran
ISMB
2000
15 years 7 months ago
Pattern Recognition of Genomic Features with Microarrays: Site Typing of Mycobacterium Tuberculosis Strains
Mycobacterium tuberculosis (M. tb.) strains differ in the number and locations of a transposon-like insertion sequence known as IS6110. Accurate detection of this sequence can be ...
Soumya Raychaudhuri, Joshua M. Stuart, Xuemin Liu,...
ALP
1992
Springer
15 years 10 months ago
Definitional Trees
Rewriting is a computational paradigm that specifies the actions, but not the control. We introduce a hierarchical structure repreat a high level of abstraction, a form of control....
Sergio Antoy