2735 search results - page 185 / 547 » Comparing notions of randomness |
VIS
2005
IEEE
14 years 11 months ago
2005
IEEE
We study the problem of visualizing large networks and develop es for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduc...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
KDD
2003
ACM
14 years 10 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
VLDB
2007
ACM
14 years 10 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...