Sciweavers

860 search results - page 154 / 172
» Biased Random Walks
Sort
View
IJRR
2011
174views more  IJRR 2011»
14 years 11 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
TNN
2010
143views Management» more  TNN 2010»
14 years 10 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...
145
Voted
CRYPTO
2012
Springer
241views Cryptology» more  CRYPTO 2012»
13 years 6 months ago
Crowd-Blending Privacy
We introduce a new definition of privacy called crowd-blending privacy that strictly relaxes the notion of differential privacy. Roughly speaking, k-crowd blending private saniti...
Johannes Gehrke, Michael Hay, Edward Lui, Rafael P...
GLOBECOM
2006
IEEE
15 years 10 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
DCOSS
2006
Springer
15 years 7 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama