Designing watermarking codes that can withstand geometric and other desynchronization attacks is a notoriously difficult problem. One may ask whether these difficulties are due to...
, K. (2004) 'Ensemble': playing with sensors and sound. Extended abstracts of CHI 2004. Vienna, Austria, ACM Press. BAGNARA, S. & SMITH, G. C. (2005) Theories and pra...
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
We describe recent work on PECAS, an architecture for intelligent robotics that supports multi-modal interaction. Categories and Subject Descriptors I.2.8 [Computing Methodologies...
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...