1039 search results - page 128 / 208 » Kernels and Regularization on Graphs |
106
click to vote
SIGMETRICS
2003
ACM
15 years 5 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
121
click to vote
CPM
1994
Springer
15 years 4 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
109
click to vote
NIPS
2008
15 years 1 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
109
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...