4343 search results - page 803 / 869 » Improving Visual Matching |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
101
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
150
Voted
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
82
Voted
SIGMOD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...