419 search results - page 35 / 84 » Improving Adaptable Similarity Query Processing by Using App... |
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
107
click to vote
SIGMOD
2001
ACM
15 years 10 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
111
click to vote
CLEF
2009
Springer
14 years 11 months ago
2009
Springer
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...
CIKM
2008
Springer
15 years 3 days ago
2008
Springer
Time is an important dimension of relevance for a large number of searches, such as over blogs and news archives. So far, research on searching over such collections has largely f...