Sciweavers

231 search results - page 9 / 47
» Simulating Multigraph Transformations Using Simple Graphs
Sort
View
SEMWEB
2004
Springer
14 years 29 days ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-object triples of information resources. Although for simple examples they can be understood intuitively...
Jonathan Hayes, Claudio Gutiérrez
CVPR
2008
IEEE
14 years 9 months ago
Spatio-temporal Saliency detection using phase spectrum of quaternion fourier transform
Salient areas in natural scenes are generally regarded as the candidates of attention focus in human eyes, which is the key stage in object detection. In computer vision, many mod...
Chenlei Guo, Qi Ma, Liming Zhang
ICPR
2008
IEEE
14 years 2 months ago
Learning a discriminative sparse tri-value transform
Simple binary patterns have been successfully used for extracting feature representations for visual object classification. In this paper, we present a method to learn a set of d...
Zhenhua Qu, Guoping Qiu, Pong Chi Yuen
GG
2004
Springer
14 years 1 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
WEA
2007
Springer
111views Algorithms» more  WEA 2007»
14 years 1 months ago
Vertex Cover Approximations on Random Graphs
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
Eyjolfur Asgeirsson, Clifford Stein