1538 search results - page 83 / 308 » Spectral Techniques in Graph Algorithms |
128
Voted
ICDM
2009
IEEE
14 years 11 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
124
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
108
click to vote
WAW
2009
Springer
15 years 8 months ago
2009
Springer
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
Extracellular recording of neural signals records the action potentials (known as spikes) of neurons adjacent to the electrode as well as the noise generated by the overall neural...
116
click to vote
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...