4536 search results - page 353 / 908 » Contention-Sensitive Data Structures and Algorithms |
200
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
184
click to vote
ICRA
2003
IEEE
16 years 2 days ago
2003
IEEE
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
205
click to vote
NIPS
2008
15 years 8 months ago
2008
Learning graphical models with hidden variables can offer semantic insights to complex data and lead to salient structured predictors without relying on expensive, sometime unatta...
158
click to vote
ESA
2010
Springer
15 years 8 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
183
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...