Sciweavers

1677 search results - page 316 / 336
» On the Completeness of Quantum Computation Models
Sort
View
CHI
2007
ACM
16 years 1 months ago
A study of out-of-turn interaction in menu-based, IVR, voicemail systems
We present the first user study of out-of-turn interaction in menu-based, interactive voice-response systems. Out-ofturn interaction is a technique which empowers the user (unable...
Saverio Perugini, Taylor J. Anderson, William F. M...
ICS
2010
Tsinghua U.
15 years 10 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
RECOMB
2010
Springer
15 years 8 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
CCS
2009
ACM
15 years 8 months ago
On non-cooperative location privacy: a game-theoretic analysis
In mobile networks, authentication is a required primitive of the majority of security protocols. However, an adversary can track the location of mobile nodes by monitoring pseudo...
Julien Freudiger, Mohammad Hossein Manshaei, Jean-...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
15 years 8 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani