Sciweavers

18306 search results - page 81 / 3662
» Algorithmics in Exponential Time
Sort
View
ICPP
2000
IEEE
15 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
CP
2001
Springer
15 years 2 months ago
Random 3-SAT and BDDs: The Plot Thickens Further
Abstract. This paper contains an experimental study of the impact of the construction strategy of reduced, ordered binary decision diagrams (ROBDDs) on the average-case computation...
Alfonso San Miguel Aguirre, Moshe Y. Vardi
TKDE
2008
133views more  TKDE 2008»
14 years 9 months ago
Streaming Time Series Summarization Using User-Defined Amnesic Functions
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractica...
Themis Palpanas, Michail Vlachos, Eamonn J. Keogh,...
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
15 years 10 months ago
Computing the first Betti number and the connected components of semi-algebraic sets
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi...
Saugata Basu, Richard Pollack, Marie-Franço...
EUROCRYPT
2007
Springer
15 years 4 months ago
Ate Pairing on Hyperelliptic Curves
Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has...
Robert Granger, Florian Hess, Roger Oyono, Nicolas...