1326 search results - page 140 / 266 » Approximate Tree Kernels |
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this paper, we develop and analyze a lowcomplexity cooperative protocol that significantly increases the average throughput of multi-hop upstream transmissions for ...
HPCC
2007
Springer
14 years 3 months ago
2007
Springer
A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can indu...
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...