Sciweavers

17 search results - page 3 / 4
» Policies for Sharing Distributed Probabilistic Beliefs
Sort
View
ANSS
1997
IEEE
13 years 9 months ago
Performance Issues of Task Routing and Task Scheduling with Resequencing in Homogeneous Distributed Systems
An important part of a distributed system design is the workload sharing among the processors. This includes partitioningthe arriving jobs into tasks that can be executed in paral...
Anthony Karageorgos, Helen D. Karatza
MM
2005
ACM
140views Multimedia» more  MM 2005»
13 years 11 months ago
Topic transition detection using hierarchical hidden Markov and semi-Markov models
In this paper we introduce a probabilistic framework to exploit hierarchy, structure sharing and duration information for topic transition detection in videos. Our probabilistic d...
Dinh Q. Phung, Thi V. Duong, Svetha Venkatesh, Hun...
POPL
2008
ACM
14 years 5 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
ATAL
2009
Springer
13 years 12 months ago
Incorporating helpful behavior into collaborative planning
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
Ece Kamar, Ya'akov Gal, Barbara J. Grosz
GLOBECOM
2006
IEEE
13 years 11 months ago
A Practical Switch-Memory-Switch Architecture Emulating PIFO OQ
— Emulating Output Queued (OQ) Switch with sustainable implementation cost and low fixed delay is always preferable in designing high performance routers. The SwitchMemory-Switch...
Nan Hua, Yang Xu, Peng Wang, Depeng Jin, Lieguang ...