5138 search results - page 558 / 1028 » Randomized Algorithms for 3-SAT |
175
Voted
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
195
Voted
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
193
Voted
ALT
2007
Springer
16 years 3 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
173
Voted
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goa...
143
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...