1321 search results - page 116 / 265 » Quadratic forms on graphs |
75
Voted
DM
2010
15 years 26 days ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...
SIGIR
2008
ACM
15 years 21 days ago
2008
ACM
Collections are a fundamental tool for reproducible evaluation of information retrieval techniques. We describe a new method for distributing the document lengths and term counts ...
113
Voted
IJICT
2007
15 years 21 days ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
115
Voted
EJC
2008
14 years 11 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
86
Voted
IFIP
2009
Springer
14 years 10 months ago
2009
Springer
We present a platform that allows a protocol researcher to specify the sequence of games from an initial protocol to a protocol where the security property under consideration can ...