796 search results - page 70 / 160 » Graph Properties Based Filtering |
115
click to vote
SEMWEB
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Building user-friendly GUIs for browsing and filtering RDF/S description bases while exploiting in a transparent way the expressiveness of declarative query/view language...
127
Voted
DAC
2009
ACM
15 years 6 months ago
2009
ACM
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
156
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
148
Voted
APPROX
2011
Springer
14 years 2 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
151
click to vote
KAIS
2011
14 years 9 months ago
2011
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...