Sciweavers

113 search results - page 3 / 23
» Data structures with dynamical random transitions
Sort
View
JACM
2010
135views more  JACM 2010»
13 years 5 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
GAMEON
2009
13 years 5 months ago
Analysis of User Trajectories Based on Data Distribution and State Transition: a Case Study with a Massively Multiplayer Online
At present, trajectory data, series of coordinate data traversed by moving objects, can be readily obtained due to the advent of positioning technologies. Clustering of trajectori...
Ruck Thawonmas, Junichi Oda, Kuan-Ta Chen
CORR
2007
Springer
120views Education» more  CORR 2007»
13 years 7 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová
IROS
2006
IEEE
202views Robotics» more  IROS 2006»
14 years 1 months ago
Topological characterization of mobile robot behavior
— We propose to classify the behaviors of a mobile robot thanks to topological methods as an alternative to metric ones. To do so, we adapt an analysis scheme from Physics of non...
Aurélien Hazan, Frédéric Dave...
COMPGEOM
2010
ACM
14 years 15 days 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