10890 search results - page 383 / 2178 » Automatic Complexity Analysis |
272
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
204
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring th...
182
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
200
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
150
click to vote
COCOON
2007
Springer
16 years 29 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...