1247 search results - page 48 / 250 » A Generalization of Jumps and Labels |
ARSCOM
2007
13 years 10 months ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
JMLR
2012
12 years 21 days ago
2012
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract— This paper deals with the long run average continuous control problem of piecewise deterministic Markov processes (PDMP‘s) taking values in a general Borel space and ...
WG
2004
Springer
14 years 3 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...