Sciweavers

296 search results - page 25 / 60
» Kernel Matching Pursuit
Sort
View
ICCV
2011
IEEE
14 years 6 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
CVPR
2012
IEEE
13 years 8 months ago
SURFing the point clouds: Selective 3D spatial pyramids for category-level object recognition
This paper proposes a novel approach to recognize object categories in point clouds. By quantizing 3D SURF local descriptors, computed on partial 3D shapes extracted from the poin...
Carolina Redondo-Cabrera, Roberto Javier Ló...
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
15 years 11 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
16 years 2 days ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
IPPS
2007
IEEE
16 years 6 days ago
Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
Carlos Morra, João M. P. Cardoso, Jürg...