3874 search results - page 400 / 775 » Approximation Algorithms for k-hurdle Problems |
166
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
Dot maps--drawings of point sets--are a well known cartographic method to visualize density functions over an area. We study the problem of simplifying a given dot map: given a se...
162
click to vote
IM
2006
15 years 6 months ago
2006
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...
165
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
190
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
177
click to vote
MICAI
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...