Sciweavers

5153 search results - page 771 / 1031
» Introduction to Randomized Algorithms
Sort
View
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
15 years 10 months ago
Stochastic mobility-based path planning in uncertain environments
— The ability of mobile robots to generate feasible trajectories online is an important requirement for their autonomous operation in unstructured environments. Many path generat...
Gaurav Kewlani, Genya Ishigami, Karl Iagnemma
146
Voted
ALGOSENSORS
2009
Springer
15 years 10 months ago
Compressing Kinetic Data from Sensor Networks
We introduce a framework for storing and processing kinetic data observed by sensor networks. These sensor networks generate vast quantities of data, which motivates a significant...
Sorelle A. Friedler, David M. Mount
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 10 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
15 years 10 months ago
On the Security of Goldreich's One-Way Function
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
Andrej Bogdanov, Youming Qiao
WAW
2009
Springer
147views Algorithms» more  WAW 2009»
15 years 10 months ago
A Dynamic Model for On-Line Social Networks
We present a deterministic model for on-line social networks based on transitivity and local knowledge in social interactions. In the Iterated Local Transitivity (ILT) model, at ea...
Anthony Bonato, Noor Hadi, Paul Horn, Pawel Pralat...