1679 search results - page 292 / 336 » Pointcuts as Functional Queries |
167
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
178
click to vote
SIGMOD
2000
ACM
15 years 10 months ago
2000
ACM
We consider spatio-temporal databases supporting spatial objects with continuously changing position and extent, termed moving objects databases. We formally define a data model f...
158
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
133
click to vote
SACRYPT
1999
Springer
15 years 10 months ago
1999
Springer
DEAL is a six- or eight-round Luby-Rackoff cipher that uses DES as its round function, with allowed key lengths of 128, 192, and 256 bits. In this paper, we discuss two new result...
150
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...