Sciweavers

5100 search results - page 228 / 1020
» The Linear Complexity of a Graph
Sort
View
89
Voted
ACCV
1998
Springer
15 years 4 months ago
Object Recognition by Matching Symbolic Edge Graphs
We present an object recognition system based on symbolic graphs with object corners as vertices and outlines as edges. Corners are determined in a robust way by a multiscale combi...
Tino Lourens, Rolf P. Würtz
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 4 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth
112
Voted
DATESO
2004
134views Database» more  DATESO 2004»
15 years 2 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
142
Voted
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 17 days ago
Link Scheduling in STDMA Wireless Networks: A Line Graph Approach
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...
N. Praneeth Kumar, Ashutosh Deepak Gore, Abhay Kar...
93
Voted
CORR
2004
Springer
117views Education» more  CORR 2004»
15 years 13 days ago
Traffic-driven model of the World Wide Web graph
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
Alain Barrat, Marc Barthelemy, Alessandro Vespigna...