Sciweavers

815 search results - page 162 / 163
» A model for dynamic and adaptable services management
Sort
View
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
14 years 28 days ago
A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
Kanishka Bhaduri, Ashok N. Srivastava
MOBISYS
2004
ACM
14 years 5 months ago
NWSLite: A Light-Weight Prediction Utility for Mobile Devices
Computation off-loading, i.e., remote execution, has been shown to be effective for extending the computational power and battery life of resource-restricted devices, e.g., hand-h...
Selim Gurun, Chandra Krintz, Richard Wolski
EMSOFT
2007
Springer
14 years 13 days ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
RTSS
1998
IEEE
13 years 10 months ago
Improved Response-Time Analysis Calculations
Schedulability analysis of fixed priority preemptive scheduled systems can be performed by calculating the worst-case response-time of the involved processes. The system is deemed...
Mikael Sjödin, Hans Hansson
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 6 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner