Sciweavers

941 search results - page 149 / 189
» The Parking Permit Problem
Sort
View
DRM
2003
Springer
15 years 5 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
COMPGEOM
2010
ACM
15 years 5 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 11 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
CIKM
2010
Springer
14 years 10 months ago
A probabilistic topic-connection model for automatic image annotation
The explosive increase of image data on Internet has made it an important, yet very challenging task to index and automatically annotate image data. To achieve that end, sophistic...
Xin Chen, Xiaohua Hu, Zhongna Zhou, Caimei Lu, Gai...
ATAL
2007
Springer
15 years 6 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone