2800 search results - page 492 / 560 » Scaling RDF with time |
349
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
245
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
The original PageRank algorithm for improving the ranking of search-query results computes a single vector, using the link structure of the Web, to capture the relative "impor...
171
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
244
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
237
click to vote
CIVR
2009
Springer
16 years 6 months ago
2009
Springer
So far, most image mining was based on interactive querying. Although
such querying will remain important in the future, several
applications need image mining at such wide scale...