Sciweavers

3897 search results - page 633 / 780
» complexity 2010
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
COMPGEOM
2010
ACM
15 years 11 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
JCDL
2010
ACM
188views Education» more  JCDL 2010»
15 years 11 months ago
Exposing the hidden web for chemical digital libraries
In recent years, the vast amount of digitally available content has lead to the creation of many topic-centered digital libraries. Also in the domain of chemistry more and more di...
Sascha Tönnies, Benjamin Köhncke, Oliver...
NPAR
2010
ACM
15 years 11 months ago
Vector fluid: a vector graphics depiction of surface flow
We present a simple technique for creating fluid silhouettes described with vector graphics, which we call ”Vector Fluid.” In our system, a solid region in the fluid is repr...
Ryoichi Ando, Reiji Tsuruno
PODS
2010
ACM
215views Database» more  PODS 2010»
15 years 11 months ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff