1732 search results - page 96 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
169
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
176
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
191
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
153
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
169
click to vote
MP
2008
15 years 6 months ago
2008
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...