Sciweavers

417 search results - page 45 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
IJCV
1998
105views more  IJCV 1998»
14 years 9 months ago
Robust Algorithms for Object Localization
Object localization using sensed data features and corresponding model features is a fundamental problem in machine vision. We reformulate object localization as a least squares p...
Aaron S. Wallack, Dinesh Manocha
BMCBI
2008
122views more  BMCBI 2008»
14 years 9 months ago
A practical comparison of two K-Means clustering algorithms
Background: Data clustering is a powerful technique for identifying data with similar characteristics, such as genes with similar expression patterns. However, not all implementat...
Gregory A. Wilkin, Xiuzhen Huang
ICPR
2010
IEEE
15 years 1 months ago
Spatial Representation for Efficient Sequence Classification
We present a general, simple feature representation of sequences that allows efficient inexact matching, comparison and classification of sequential data. This approach, recently ...
Pavel Kuksa, Vladimir Pavlovic
AIRS
2008
Springer
14 years 11 months ago
Efficient Feature Selection in the Presence of Outliers and Noises
Although regarded as one of the most successful algorithm to identify predictive features, Relief is quite vulnerable to outliers and noisy features. The recently proposed I-Relief...
Shuang-Hong Yang, Bao-Gang Hu
PAMI
2012
13 years 4 days ago
Image Signature: Highlighting Sparse Salient Regions
—We introduce a simple image descriptor referred to as the image signature. We show, within the theoretical framework of sparse signal mixing, that this quantity spatially approx...
Xiaodi Hou, Jonathan Harel, Christof Koch