Sciweavers

917 search results - page 126 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ACL
2010
14 years 7 months ago
Convolution Kernel over Packed Parse Forest
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
Min Zhang, Hui Zhang, Haizhou Li
BIOINFORMATICS
2007
123views more  BIOINFORMATICS 2007»
14 years 10 months ago
A comparative genome approach to marker ordering
Motivation: Genome maps are fundamental to the study of an organism and essential in the process of genome sequencing which in turn provides the ultimate map of the genome. The in...
Thomas Faraut, Simon de Givry, Patrick Chabrier, T...
RECOMB
2009
Springer
15 years 10 months ago
Haplotype Inference in Complex Pedigrees
Abstract. Despite the desirable information contained in complex pedigree datasets, analysis methods struggle to efficiently process these datasets. The attractiveness of pedigree ...
Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Ri...
ICDM
2006
IEEE
133views Data Mining» more  ICDM 2006»
15 years 3 months ago
An Experimental Investigation of Graph Kernels on a Collaborative Recommendation Task
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
François Fouss, Luh Yen, Alain Pirotte, Mar...
DCC
2000
IEEE
15 years 2 months ago
Iterative Source/Channel-Decoding Using Reversible Variable Length Codes
In this paper we describe a trellis representation of variable length coded data which is capable of being used for bit-level or symbol-level maximum a posteriori (MAP) decoding o...
Rainer Bauer, Joachim Hagenauer