Sciweavers

1221 search results - page 42 / 245
» A Comparison of Two Programming Models for Pervasive Computi...
Sort
View
ICDAR
2007
IEEE
15 years 5 months ago
On Computing Strength of Evidence for Writer Verification
The problem of Writer Verification is to make a decision of whether or not two handwritten documents are written by the same person. Providing a strength of evidence for any such ...
Harish Srinivasan, S. Kabra, Chen Huang, Sargur N....
ICCV
2007
IEEE
16 years 3 months ago
Probabilistic Color and Adaptive Multi-Feature Tracking with Dynamically Switched Priority Between Cues
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
François Le Clerc, Lionel Oisel, Patrick P&...
MCS
2010
Springer
15 years 6 months ago
An Experimental Comparison of Hierarchical Bayes and True Path Rule Ensembles for Protein Function Prediction
Abstract. The computational genome-wide annotation of gene functions requires the prediction of hierarchically structured functional classes and can be formalized as a multiclass, ...
Matteo Re, Giorgio Valentini
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
15 years 10 days ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
ECCV
2002
Springer
16 years 3 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel