Sciweavers

10899 search results - page 1913 / 2180
» Wide Area Computation
Sort
View
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
DMSN
2009
ACM
16 years 1 months ago
Message models and aggregation in knowledge based middleware for rich sensor systems
Networked, distributed real world sensing is an increasingly prominent topic in computing and has quickly expanded from resource constrained “sensor networks” measuring simple...
Joseph B. Kopena, William C. Regli, Boon Thau Loo
AINA
2008
IEEE
16 years 1 months ago
Missing Value Estimation for Time Series Microarray Data Using Linear Dynamical Systems Modeling
The analysis of gene expression time series obtained from microarray experiments can be effectively exploited to understand a wide range of biological phenomena from the homeostat...
Connie Phong, Raul Singh
CLUSTER
2008
IEEE
16 years 1 months ago
A trace-driven emulation framework to predict scalability of large clusters in presence of OS Jitter
—Various studies have pointed out the debilitating effects of OS Jitter on the performance of parallel applications on large clusters such as the ASCI Purple and the Mare Nostrum...
Pradipta De, Ravi Kothari, Vijay Mann
FOCS
2008
IEEE
16 years 1 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
« Prev « First page 1913 / 2180 Last » Next »