Sciweavers

5115 search results - page 938 / 1023
» On Randomized Lanczos Algorithms
Sort
View
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
15 years 5 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
TIP
1998
142views more  TIP 1998»
15 years 5 months ago
Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
Mila Nikolova, Jérôme Idier, Ali Moha...
IS
2010
15 years 4 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
SADM
2010
128views more  SADM 2010»
15 years 4 months ago
Online training on a budget of support vector machines using twin prototypes
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
Zhuang Wang, Slobodan Vucetic
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 2 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely