14774 search results - page 2657 / 2955 » Computational complexity and evolutionary computation |
212
click to vote
COMPGEOM
2010
ACM
16 years 11 days ago
2010
ACM
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...
278
click to vote
COMPGEOM
2010
ACM
16 years 11 days ago
2010
ACM
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 ...
182
click to vote
PODS
2010
ACM
16 years 11 days ago
2010
ACM
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...
226
click to vote
ICTAI
2002
IEEE
16 years 7 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
198
click to vote
RTSS
2002
IEEE
16 years 6 days ago
2002
IEEE
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...