Sciweavers

1920 search results - page 174 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 4 months ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh
ICSE
2010
IEEE-ACM
15 years 9 months ago
Dynamic symbolic data structure repair
Generic repair of complex data structures is a new and exciting area of research. Existing approaches can integrate with good software engineering practices such as program assert...
Ishtiaque Hussain, Christoph Csallner
RSS
2007
119views Robotics» more  RSS 2007»
15 years 5 months ago
BS-SLAM: Shaping the World
— This paper presents BS-SLAM, a simultaneous localization and mapping algorithm for use in unstructured environments that is effective regardless of whether features correspond ...
Luis Pedraza, Gamini Dissanayake, Jaime Valls Mir&...
SAC
2008
ACM
15 years 3 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
SIGECOM
2005
ACM
106views ECommerce» more  SIGECOM 2005»
15 years 10 months ago
On decentralized incentive compatible mechanisms
Algorithmic Mechanism Design focuses on Dominant Strategy Implementations. The main positive results are the celebrated Vickrey-Clarke-Groves (VCG) mechanisms and computationally ...
Ahuva Mu'alem