Sciweavers

492 search results - page 64 / 99
» The number of possibilities for random dating
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Hidden Markov Support Vector Machines
This paper presents a novel discriminative learning technique for label sequences based on a combination of the two most successful learning algorithms, Support Vector Machines an...
Yasemin Altun, Ioannis Tsochantaridis, Thomas Hofm...
RECOMB
2004
Springer
14 years 9 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
14 years 6 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
ATS
2009
IEEE
117views Hardware» more  ATS 2009»
14 years 3 months ago
N-distinguishing Tests for Enhanced Defect Diagnosis
Diagnostic ATPG has traditionally been used to generate test patterns that distinguish pairs of modeled faults. In this work, we investigate the use of n-distinguishing test sets,...
Gang Chen, Janusz Rajski, Sudhakar M. Reddy, Irith...
GLOBECOM
2009
IEEE
14 years 3 months ago
Accelerating Initialization for Sensor Networks
—Initialization is an indispensable process for wireless sensor networks since newly deployed sensors lack a reliable infrastructure for communication. Many efforts have been mad...
Linghe Kong, Luoyi Fu, Xuemei Liu, Min-You Wu