Sciweavers

143 search results - page 20 / 29
» Revisiting Negative Selection Algorithms
Sort
View
BMCBI
2007
145views more  BMCBI 2007»
13 years 7 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
SIGIR
2004
ACM
14 years 29 days ago
Constructing a text corpus for inexact duplicate detection
As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. The goal of this work i...
Jack G. Conrad, Cindy P. Schriber
BIOADIT
2004
Springer
13 years 11 months ago
An Artificial Immune System Approach to Misbehavior Detection in Mobile Ad Hoc Networks
Abstract. In mobile ad-hoc networks, nodes act both as terminals and information relays, and participate in a common routing protocol, such as Dynamic Source Routing (DSR). The net...
Jean-Yves Le Boudec, Slavisa Sarafijanovic
AE
2009
Springer
13 years 8 months ago
Artificial Evolution for 3D PET Reconstruction
This paper presents a method to take advantage of artificial evolution in positron emission tomography reconstruction. This imaging technique produces datasets that correspond to t...
Franck Patrick Vidal, Delphine Lazaro-Ponthus, Sam...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 8 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto