10996 search results - page 1801 / 2200 » Future Directions in Computing |
154
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
188
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
— Many applications offer a form-based environment for na¨ıve users for accessing databases without being familiar with the database schema or a structured query language. User...
198
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
163
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
168
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...