Sciweavers

3241 search results - page 35 / 649
» Challenges for Dataset Search
Sort
View
BIBE
2006
IEEE
15 years 4 months ago
Extending Pattern Branching to Handle Challenging Instances
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
Jaime Davila, Sanguthevar Rajasekaran
ICASSP
2011
IEEE
14 years 2 months ago
Large vocabulary continuous speech recognition with context-dependent DBN-HMMS
The context-independent deep belief network (DBN) hidden Markov model (HMM) hybrid architecture has recently achieved promising results for phone recognition. In this work, we pro...
George E. Dahl, Dong Yu, Li Deng, Alex Acero
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
15 years 4 months ago
Improved face finding in visually challenging environments
Finding faces in visually challenging environments is crucial to many applications, such as audio-visual automatic speech recognition, video indexing, person recognition, and vide...
Jintao Jiang, Gerasimos Potamianos, Giridharan Iye...
CORR
2004
Springer
122views Education» more  CORR 2004»
14 years 10 months ago
"In vivo" spam filtering: A challenge problem for data mining
Spam, also known as Unsolicited Commercial Email (UCE), is the bane of email communication. Many data mining researchers have addressed the problem of detecting spam, generally by...
Tom Fawcett
KDD
2004
ACM
131views Data Mining» more  KDD 2004»
15 years 11 months ago
Fast nonlinear regression via eigenimages applied to galactic morphology
Astronomy increasingly faces the issue of massive datasets. For instance, the Sloan Digital Sky Survey (SDSS) has so far generated tens of millions of images of distant galaxies, ...
Brigham Anderson, Andrew W. Moore, Andrew Connolly...