2004 search results - page 31 / 401 » Sampling from large graphs |
185
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
101
click to vote
CIKM
2009
Springer
15 years 3 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
105
click to vote
AIPS
2000
15 years 1 months ago
2000
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
129
click to vote
APVIS
2011
13 years 11 months ago
2011
Graphs are often used to encapsulate relationships between objects. Node-link diagrams, commonly used to visualize graphs, suffer from visual clutter on large graphs. Edge bundlin...
104
click to vote
PRL
2010
14 years 10 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...