1161 search results - page 104 / 233 » Kinetic Dependence Graphs |
119
Voted
PLDI
2009
ACM
15 years 7 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
114
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
142
click to vote
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
106
Voted
IJON
2010
14 years 10 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
93
Voted
EDBT
2008
ACM
16 years 23 days ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...