Sciweavers

482 search results - page 61 / 97
» A Linear-Time Graph Kernel
Sort
View
LATA
2009
Springer
15 years 4 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
14 years 10 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
CVPR
2008
IEEE
15 years 11 months ago
Relaxed matching kernels for robust image comparison
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...
Andrea Vedaldi, Stefano Soatto
CCS
2007
ACM
15 years 4 months ago
Automated detection of persistent kernel control-flow attacks
This paper presents a new approach to dynamically monitoring operating system kernel integrity, based on a property called state-based control-flow integrity (SBCFI). Violations ...
Nick L. Petroni Jr., Michael W. Hicks
CIKM
2008
Springer
14 years 11 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao