Sciweavers

15033 search results - page 123 / 3007
» Complexity Theory and Algorithms
Sort
View
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 4 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
COMPGEOM
2008
ACM
15 years 5 months ago
Reeb spaces of piecewise linear mappings
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
Herbert Edelsbrunner, John Harer, Amit K. Patel
DAGSTUHL
2007
15 years 5 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
COMPGEOM
2011
ACM
14 years 7 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 3 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook