Sciweavers

736 search results - page 61 / 148
» Classification with Scattering Operators
Sort
View
COCOA
2008
Springer
13 years 9 months ago
Parameterized Graph Editing with Chosen Vertex Degrees
We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations a...
Luke Mathieson, Stefan Szeider
CVPR
2008
IEEE
14 years 9 months ago
Robust null space representation and sampling for view-invariant motion trajectory analysis
In this paper, we propose a novel robust retrieval and classification system for video and motion events based on null space representation. In order to analyze the robustness of ...
Xu Chen, Dan Schonfeld, Ashfaq A. Khokhar
AI
2006
Springer
13 years 7 months ago
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
David A. Cohen, Martin C. Cooper, Peter Jeavons, A...
ICPR
2004
IEEE
14 years 8 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
13 years 9 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...