Sciweavers

1632 search results - page 9 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
90
Voted
ISSAC
2009
Springer
147views Mathematics» more  ISSAC 2009»
15 years 4 months ago
Fast algorithms for differential equations in positive characteristic
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
Alin Bostan, Éric Schost
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
14 years 11 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
BMCBI
2006
129views more  BMCBI 2006»
14 years 9 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
MFCS
1994
Springer
15 years 1 months ago
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams
We show that the wavefront approach to Voronoi diagrams (a deterministic line sweep algorithm that does not use geometric transform) can be generalized to distance measures more g...
Frank K. H. A. Dehne, Rolf Klein
IM
2006
14 years 9 months ago
Estimating Entropy and Entropy Norm on Data Streams
We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result deals with a measure we call the &quo...
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan