2190 search results - page 249 / 438 » An optimal algorithm to generate tilings |
209
click to vote
CIAC
1994
Springer
15 years 10 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
243
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— In this paper, we study the problem of efficiently computing multiple aggregation queries over a data stream. In order to share computation, prior proposals have suggested ins...
328
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
228
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
174
click to vote
CGO
2010
IEEE
15 years 11 months ago
2010
IEEE
Feedback-directed optimization (FDO) is effective in improving application runtime performance, but has not been widely adopted due to the tedious dual-compilation model, the dif...