Sciweavers

71 search results - page 5 / 15
» Comparisons of sequence labeling algorithms and extensions
Sort
View
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 10 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
BMCBI
2002
131views more  BMCBI 2002»
13 years 8 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
BMCBI
2007
175views more  BMCBI 2007»
13 years 8 months ago
CLUSS: Clustering of protein sequences based on a new similarity measure
Background: The rapid burgeoning of available protein data makes the use of clustering within families of proteins increasingly important. The challenge is to identify subfamilies...
Abdellali Kelil, Shengrui Wang, Ryszard Brzezinski...
ICML
2009
IEEE
14 years 9 months ago
Robust feature extraction via information theoretic learning
In this paper, we present a robust feature extraction framework based on informationtheoretic learning. Its formulated objective aims at simultaneously maximizing the Renyi's...
Xiaotong Yuan, Bao-Gang Hu
PAMI
2006
206views more  PAMI 2006»
13 years 8 months ago
MILES: Multiple-Instance Learning via Embedded Instance Selection
Multiple-instance problems arise from the situations where training class labels are attached to sets of samples (named bags), instead of individual samples within each bag (called...
Yixin Chen, Jinbo Bi, James Ze Wang