1039 search results - page 120 / 208 » Kernels and Regularization on Graphs |
126
click to vote
DAM
2006
15 years 6 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
210
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
138
click to vote
ENDM
2007
15 years 6 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
139
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
200
click to vote
CATS
2008
15 years 7 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...