Sciweavers

1321 search results - page 116 / 265
» Quadratic forms on graphs
Sort
View
DM
2010
79views more  DM 2010»
14 years 10 months ago
Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
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 \ ...
Steve Kirkland
SIGIR
2008
ACM
14 years 10 months ago
Compressed collections for simulated crawling
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 ...
Alessio Orlandi, Sebastiano Vigna
IJICT
2007
143views more  IJICT 2007»
14 years 10 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
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...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar
EJC
2008
14 years 8 months ago
Locating sensors in paths and cycles: The case of 2-identifying codes
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...
David L. Roberts, Fred S. Roberts
IFIP
2009
Springer
14 years 7 months ago
A User Interface for a Game-Based Protocol Verification Tool
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 ...
Peeter Laud, Ilja Tsahhirov