1170 search results - page 216 / 234 » How Fast Is Too Fast |
110
Voted
SIGMOD
2010
ACM
15 years 5 months ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
115
Voted
IBPRIA
2009
Springer
15 years 5 months ago
2009
Springer
ent abstract presents OASIS, an Online Algorithm for Scalable Image Similarity learning that learns a bilinear similarity measure over sparse representations. OASIS is an online du...
126
Voted
LCPC
2009
Springer
15 years 5 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...
140
click to vote
CEEMAS
2001
Springer
15 years 5 months ago
2001
Springer
Developing multi-agent simulations seems to be rather straight forward, as active entities in the original correspond to active agents in the model. Thus plausible behaviors can be...
97
Voted
VLDB
2001
ACM
15 years 5 months ago
2001
ACM
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...