Sciweavers

420 search results - page 63 / 84
» Generating random regular graphs
Sort
View
103
Voted
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
15 years 6 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...
159
Voted
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
15 years 3 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
FC
2007
Springer
141views Cryptology» more  FC 2007»
15 years 8 months ago
The Unbearable Lightness of PIN Cracking
Responding to the PIN cracking attacks from Berkman and Ostrovsky (FC 2007), we outline a simple solution called salted-PIN. A randomly generated salt value of adequate length (e.g...
Omer Berkman, Odelia Moshe Ostrovsky
ICS
2010
Tsinghua U.
15 years 11 months ago
Local Algorithms for Finding Interesting Individuals in Large Networks
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
Mickey Brautbar, Michael Kearns
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 8 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert