Sciweavers

3770 search results - page 727 / 754
» Building a Stochastic Dynamic Model of Application Use
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
OOPSLA
2007
Springer
14 years 1 months ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
IPPS
2006
IEEE
14 years 1 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
IPPS
1998
IEEE
13 years 12 months ago
Runtime Support for Virtual BSP Computer
Abstract. Several computing environments including wide area networks and nondedicated networks of workstations are characterized by frequent unavailability of the participating ma...
Mohan V. Nibhanupudi, Boleslaw K. Szymanski
RTAS
2011
IEEE
12 years 11 months ago
ARCH: Practical Channel Hopping for Reliable Home-Area Sensor Networks
Abstract—Home area networks (HANs) promise to enable sophisticated home automation applications such as smart energy usage and assisted living. However, recent empirical study of...
Mo Sha, Gregory Hackmann, Chenyang Lu