552 search results - page 79 / 111 » Efficient Algorithms for Processing XPath Queries |
156
click to vote
SSD
2007
Springer
15 years 5 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
105
click to vote
EUROPAR
2008
Springer
15 years 1 months ago
2008
Springer
We present a distributed index data structure and algorithms devised to support parallel query processing of multimedia content in search engines. We present a comparative study wi...
157
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...
UAI
2000
15 years 1 months ago
2000
Techniques for plan recognition under uncertainty require a stochastic model of the plangeneration process. We introduce probabilistic state-dependent grammars (PSDGs) to represen...
165
click to vote
SIGMOD
2006
ACM
15 years 12 months ago
2006
ACM
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...