10412 search results - page 319 / 2083 » The efficiency of algorithms - misconceptions |
230
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
226
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
214
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper explores the aggregate effect when caching multiple versions of the same Web object in the transcoding proxy. Explicitly, the aggregate profit from caching multiple ver...
130
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
133
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Efficiently finding Web services on the Web is a challenging issue in service-oriented computing. Currently, UDDI is a standard for publishing and discovery of Web services, and U...