Sciweavers

3444 search results - page 258 / 689
» A Theory of Object-Oriented Design
Sort
View
ICIP
2006
IEEE
16 years 8 months ago
On the Optimal Structure of Watermark Decoders Under Desynchronization Attacks
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...
Pierre Moulin
155
Voted
CHI
2004
ACM
16 years 7 months ago
'Ensemble': playing with sensors and sound
, 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...
Kristina Andersen
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
16 years 1 months ago
Practical Nearest Neighbor Search in the Plane
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 ...
Michael Connor, Piyush Kumar
HRI
2009
ACM
16 years 1 months ago
Planning as an architectural control mechanism
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...
Nick Hawes, Michael Brenner, Kristoffer Sjö&o...
COMPGEOM
2004
ACM
16 years 5 days ago
The geometric thickness of low degree graphs
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...