Sciweavers

561 search results - page 87 / 113
» Shortest-Path Kernels on Graphs
Sort
View
CG
2004
Springer
13 years 7 months ago
Point cloud surfaces using geometric proximity graphs
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...
Jan Klein, Gabriel Zachmann
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 7 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
14 years 9 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
14 years 1 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
13 years 9 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