Sciweavers

3359 search results - page 287 / 672
» A Simplified Idea Algorithm
Sort
View
144
Voted
ECCV
2008
Springer
16 years 5 months ago
Weakly Supervised Object Localization with Stable Segmentations
Multiple Instance Learning (MIL) provides a framework for training a discriminative classifier from data with ambiguous labels. This framework is well suited for the task of learni...
Carolina Galleguillos, Boris Babenko, Andrew Rabin...
130
Voted
ICIP
2003
IEEE
16 years 5 months ago
Image filling-in in a decomposition space
An algorithm for the simultaneous filling-in of texture and structure in regions of missing image information is presented in this paper. The basic idea is to first decompose the ...
Marcelo Bertalmío, Luminita A. Vese, Guille...
133
Voted
KDD
2003
ACM
146views Data Mining» more  KDD 2003»
16 years 3 months ago
Probabilistic discovery of time series motifs
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
Bill Yuan-chi Chiu, Eamonn J. Keogh, Stefano Lonar...
114
Voted
MOBIHOC
2004
ACM
16 years 3 months ago
Error characteristics of ad hoc positioning systems (aps)
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
Dragos Niculescu, Badri Nath
126
Voted
PPOPP
2010
ACM
16 years 19 days ago
Structure-driven optimizations for amorphous data-parallel programs
Irregular algorithms are organized around pointer-based data structures such as graphs and trees, and they are ubiquitous in applications. Recent work by the Galois project has pr...
Mario Méndez-Lojo, Donald Nguyen, Dimitrios...