Sciweavers

69 search results - page 4 / 14
» The Ackermann Award 2008
Sort
View
ICNS
2008
IEEE
14 years 6 days ago
Reliable Evidence of Data Integrity from an Untrusted Storage Service
Digital storage demand is growing with the increasing use of digital artifacts from media files to business documents. Regulatory frameworks ask for unaltered, durable storage of...
Claudius Stern, Philipp Adelt, Volker Krummel, Mar...
SODA
2008
ACM
83views Algorithms» more  SODA 2008»
13 years 7 months ago
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
Seth Pettie
PODC
2011
ACM
12 years 8 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 5 months ago
Bounds on Codes Based on Graph Theory
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...
Salim Y. El Rouayheb, Costas N. Georghiades, Emina...
IROS
2006
IEEE
107views Robotics» more  IROS 2006»
13 years 11 months ago
Natural Motion Generation for Humanoid Robots
ion". Technical Sketch. ACM SIGGRAPH 2002 Conference Abstracts and Applications. AWARDS 2007 – 2008 Siebel Scholar Fellowship 2003 – 2007 Thomas V. Jones Stanford Graduate...
Kensuke Harada, Kris K. Hauser, Timothy Bretl, Jea...