1172 search results - page 138 / 235 » Path Algorithms on Regular Graphs |
118
Voted
SIGSOFT
1994
ACM
15 years 4 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
134
click to vote
COCOON
2009
Springer
15 years 7 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
115
click to vote
CIKM
2011
Springer
14 years 18 days ago
2011
Springer
Traditional feature selection methods assume that the data are independent and identically distributed (i.i.d.). In real world, tremendous amounts of data are distributed in a net...
106
click to vote
DATAMINE
2000
15 years 13 days ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
STOC
2004
ACM
16 years 28 days ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...