Sciweavers

389 search results - page 74 / 78
» A Correspondence Metric for Imitation
Sort
View
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
15 years 2 months ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
RECOMB
1997
Springer
15 years 1 months ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
KDD
2010
ACM
310views Data Mining» more  KDD 2010»
15 years 1 months ago
An integrated machine learning approach to stroke prediction
Stroke is the third leading cause of death and the principal cause of serious long-term disability in the United States. Accurate prediction of stroke is highly valuable for early...
Aditya Khosla, Yu Cao, Cliff Chiung-Yu Lin, Hsu-Ku...
ACNS
2004
Springer
85views Cryptology» more  ACNS 2004»
15 years 1 months ago
CamouflageFS: Increasing the Effective Key Length in Cryptographic Filesystems on the Cheap
One of the few quantitative metrics used to evaluate the security of a cryptographic file system is the key length of the encryption algorithm; larger key lengths correspond to hig...
Michael E. Locasto, Angelos D. Keromytis
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
14 years 11 months ago
Towards Finding Valuable Topics
Enterprises depend on their information workers finding valuable information to be productive. However, existing enterprise search and recommendation systems can exploit few studi...
Zhen Wen, Ching-Yung Lin