18306 search results - page 334 / 3662 » Algorithmics in Exponential Time |
200
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We show how to maintain the width of a set of n planar points subject to insertions and deletions of points in O( n log3 n) amortized time per update. Previously, no fully dynami...
171
click to vote
IJON
2008
15 years 6 months ago
2008
We study an efficient dynamic blind source separation algorithm of convolutive sound mixtures based on updating statistical information in the frequency domain, and minimizing the...
145
click to vote
IWANN
2009
Springer
16 years 1 months ago
2009
Springer
This paper presents an algorithm, different from the classical time series, specialised in extracting knowledge from time series. The algorithm,
166
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
155
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...