Sciweavers

1816 search results - page 242 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
ACCV
2010
Springer
15 years 1 months ago
Pedestrian Recognition with a Learned Metric
This paper presents a new method for viewpoint invariant pedestrian recognition problem. We use a metric learning framework to obtain a robust metric for large margin nearest neigh...
Mert Dikmen, Emre Akbas, Thomas S. Huang, Narendra...
JCAM
2010
116views more  JCAM 2010»
15 years 1 months ago
A vertex-based hierarchical slope limiter for p-adaptive discontinuous Galerkin methods
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
Dmitri Kuzmin
PAMI
2010
207views more  PAMI 2010»
15 years 1 months ago
Document Ink Bleed-Through Removal with Two Hidden Markov Random Fields and a Single Observation Field
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
Christian Wolf
ICASSP
2011
IEEE
14 years 10 months ago
How efficient is estimation with missing data?
In this paper, we present a new evaluation approach for missing data techniques (MDTs) where the efficiency of those are investigated using listwise deletion method as reference....
Seliz G. Karadogan, Letizia Marchegiani, Lars Kai ...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 8 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals