Sciweavers

1698 search results - page 189 / 340
» Growing Complex Games
Sort
View
PODS
2006
ACM
96views Database» more  PODS 2006»
15 years 10 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
DCC
2005
IEEE
15 years 9 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
15 years 4 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
TRUSTBUS
2009
Springer
15 years 4 months ago
The OPL Access Control Policy Language
Abstract. Existing policy languages suffer from a limited ability of directly and elegantly expressing high-level access control principles such as history-based separation of dut...
Christopher Alm, Ruben Wolf, Joachim Posegga
ICSEA
2008
IEEE
15 years 4 months ago
Model-Driven Development of Human Tasks for Workflows
In order to increase efficiency, enterprises support their business processes by information technology (IT). The majority of business processes requires human interaction. By mea...
Stefan Link, Philip Hoyer, Thomas Schuster, Sebast...