Sciweavers

180 search results - page 34 / 36
» Improved bounds on the sample complexity of learning
Sort
View
TRECVID
2008
13 years 9 months ago
The MediaMill TRECVID 2008 Semantic Video Search Engine
In this paper we describe our TRECVID 2008 video retrieval experiments. The MediaMill team participated in three tasks: concept detection, automatic search, and interactive search...
Cees G. M. Snoek, Koen E. A. van de Sande, Ork de ...
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
13 years 7 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
14 years 2 months ago
Enhancing SAT-based sequential depth computation by pruning search space
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
Yung-Chih Chen, Chun-Yao Wang
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
13 years 5 months ago
Evaluating Statistical Tests for Within-Network Classifiers of Relational Data
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
Jennifer Neville, Brian Gallagher, Tina Eliassi-Ra...
BMCBI
2010
145views more  BMCBI 2010»
13 years 7 months ago
Clustering metagenomic sequences with interpolated Markov models
Background: Sequencing of environmental DNA (often called metagenomics) has shown tremendous potential to uncover the vast number of unknown microbes that cannot be cultured and s...
David R. Kelley, Steven L. Salzberg