725 search results - page 116 / 145 » Bounding Degrees on RPL |
192
Voted
GIS
2007
ACM
16 years 1 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
109
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
110
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
106
click to vote
PODS
2003
ACM
16 years 27 days ago
2003
ACM
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
DCC
2005
IEEE
16 years 11 days ago
2005
IEEE
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...