Sciweavers

2629 search results - page 525 / 526
» complex 2009
Sort
View
PODC
2009
ACM
14 years 5 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
PODC
2009
ACM
14 years 5 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
KDD
2009
ACM
210views Data Mining» more  KDD 2009»
14 years 5 months ago
Large-scale behavioral targeting
Behavioral targeting (BT) leverages historical user behavior to select the ads most relevant to users to display. The state-of-the-art of BT derives a linear Poisson regression mo...
Ye Chen, Dmitry Pavlov, John F. Canny
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 5 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
ICRA
2009
IEEE
176views Robotics» more  ICRA 2009»
13 years 12 months ago
Rollin' Justin - Mobile platform with variable base
Abstract— Research on humanoid robots for use in servicing tasks, e.g. fetching and delivery, attracts steadily more interest. With ”Rollin’ Justin” a mobile robotic system...
Christoph Borst, Thomas Wimböck, Florian Schm...