1105 search results - page 168 / 221 » Linear choosability of graphs |
102
click to vote
PAKDD
2007
ACM
15 years 6 months ago
2007
ACM
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
104
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we explore, from an algorithmic point of view, the extent to which the facial angles and combinatorial structure of a convex polyhedron determine the polyhedron—in ...
106
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
104
click to vote
CSB
2005
IEEE
15 years 5 months ago
2005
IEEE
The increasing availability of interaction graphs requires new resource-efficient tools capable of extracting valuable biological knowledge from these networks. In this paper we ...
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...