Sciweavers

1028 search results - page 117 / 206
» Character sets of strings
Sort
View
JMLR
2006
156views more  JMLR 2006»
13 years 9 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 7 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
SIGMOD
2011
ACM
150views Database» more  SIGMOD 2011»
12 years 12 months ago
WHAM: a high-throughput sequence alignment method
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
Yinan Li, Allison Terrell, Jignesh M. Patel
ICDAR
2011
IEEE
12 years 8 months ago
HMM-Based Alignment of Inaccurate Transcriptions for Historical Documents
—For historical documents, available transcriptions typically are inaccurate when compared with the scanned document images. Not only the position of the words and sentences are ...
Andreas Fischer, Emanuel Indermühle, Volkmar ...

Publication
285views
14 years 28 days ago
Center of mass encoding: a self-adaptive representation with adjustable redundancy for real-valued parameters
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
Claudio Mattiussi, Peter Dürr, Dario Floreano