1039 search results - page 104 / 208 » Kernels and Regularization on Graphs |
102
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
108
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
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 ...
128
Voted
MOC
2010
14 years 10 months ago
2010
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...
146
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
150
click to vote
IJON
2010
15 years 2 months ago
2010
In this paper, we propose an object tracking framework based on a spatial pyramid heat kernel structural information representation. In the tracking framework, we take advantage o...