1039 search results - page 131 / 208 » Kernels and Regularization on Graphs |
EGH
2009
Springer
14 years 9 months ago
2009
Springer
Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architect...
110
click to vote
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
GBRPR
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...
IJWGS
2006
14 years 12 months ago
2006
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
125
click to vote
ODBIS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet...