Sciweavers

2192 search results - page 299 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ICALP
2009
Springer
16 years 3 months ago
Learning Halfspaces with Malicious Noise
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
Adam R. Klivans, Philip M. Long, Rocco A. Servedio
154
Voted
IPPS
2008
IEEE
15 years 10 months ago
High-speed string searching against large dictionaries on the Cell/B.E. Processor
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
149
Voted
3DIM
1999
IEEE
15 years 7 months ago
Large Data Sets and Confusing Scenes in 3-D Surface Matching and Recognition
In this paper, we report on recent extensions to a surface matching algorithm based on local 3-D signatures. This algorithm was previously shown to be effective in view registrati...
Owen T. Carmichael, Daniel F. Huber, Martial Heber...
117
Voted
BMCBI
2006
74views more  BMCBI 2006»
15 years 3 months ago
An unsupervised classification scheme for improving predictions of prokaryotic TIS
Background: Although it is not difficult for state-of-the-art gene finders to identify coding regions in prokaryotic genomes, exact prediction of the corresponding translation ini...
Maike Tech, Peter Meinicke
140
Voted
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
15 years 10 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin