Sciweavers

885 search results - page 144 / 177
» Random Matrices in Data Analysis
Sort
View
EDBT
2006
ACM
190views Database» more  EDBT 2006»
14 years 7 months ago
Fast Approximate Wavelet Tracking on Streams
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...
Graham Cormode, Minos N. Garofalakis, Dimitris Sac...
MST
2010
155views more  MST 2010»
13 years 2 months ago
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
We consider the important problem of energy balanced data propagation in wireless sensor networks and we extend and generalize previous works by allowing adaptive energy assignment...
Pierre Leone, Sotiris E. Nikoletseas, José ...
ISBI
2008
IEEE
14 years 8 months ago
Improved fMRI group studies based on spatially varying non-parametric BOLD signal modeling
Multi-subject analysis of functional Magnetic Resonance Imaging (fMRI) data relies on within-subject studies, which are usually conducted using a massively univariate approach. In...
Philippe Ciuciu, Thomas Vincent, Anne-Laure Fouque...
CIKM
2009
Springer
13 years 11 months ago
Terminology mining in social media
The highly variable and dynamic word usage in social media presents serious challenges for both research and those commercial applications that are geared towards blogs or other u...
Magnus Sahlgren, Jussi Karlgren
HIPC
2007
Springer
13 years 11 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri