Sciweavers

1435 search results - page 91 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
SPIESR
1997
97views Database» more  SPIESR 1997»
14 years 11 months ago
Multiscale Branch-and-Bound Image Database Search
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
Jau-Yuen Chen, Charles A. Bouman, Jan P. Allebach
ICML
2005
IEEE
15 years 10 months ago
Using additive expert ensembles to cope with concept drift
We consider online learning where the target concept can change over time. Previous work on expert prediction algorithms has bounded the worst-case performance on any subsequence ...
Jeremy Z. Kolter, Marcus A. Maloof
ICSE
2005
IEEE-ACM
15 years 10 months ago
Data structure repair using goal-directed reasoning
Data structure repair is a promising technique for enabling programs to execute successfully in the presence of otherwise fatal data structure corruption errors. Previous research...
Brian Demsky, Martin C. Rinard
DAC
2004
ACM
15 years 10 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
ISBI
2011
IEEE
14 years 1 months ago
Automated lineage tree reconstruction from Caenorhabditis elegans image data using particle filtering based cell tracking
Caenorhabditis elegans is an important model organism for the study of molecular mechanisms of development and disease processes, due to its well-known genome and invariant cell l...
Noemí Carranza-Herrezuelo, Ihor Smal, Oleh ...