1425 search results - page 102 / 285 » Beyond Dependency Graphs |
JUCS
2006
13 years 8 months ago
2006
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
PR
2010
13 years 6 months ago
2010
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
ISBI
2006
IEEE
14 years 9 months ago
2006
IEEE
Clinical and research neurosurgical studies involving the use of intracranial electroencephalography and cortical stimulation depend critically on accurate localization of electro...
SIGOPSE
2004
ACM
14 years 1 months ago
2004
ACM
This paper promotes accountability as a central design goal for dependable networked systems. We define three properties for accountable systems that extend beyond the basic secu...