Sciweavers

459 search results - page 15 / 92
» Computational Complexity of Probabilistic Disambiguation
Sort
View
ASPLOS
2008
ACM
15 years 1 months ago
SoftSig: software-exposed hardware signatures for code analysis and optimization
Many code analysis techniques for optimization, debugging, or parallelization need to perform runtime disambiguation of sets of addresses. Such operations can be supported efficie...
James Tuck, Wonsun Ahn, Luis Ceze, Josep Torrellas
IJCAI
2003
15 years 1 months ago
On the Design of Social Diagnosis Algorithms for Multi-Agent Teams
Teamwork demands agreement among teammembers to collaborate and coordinate effectively. When a disagreement between teammates occurs (due to failures), team-members should ideally...
Meir Kalech, Gal A. Kaminka
ECCV
2008
Springer
15 years 24 days ago
Multi-thread Parsing for Recognizing Complex Events in Videos
This paper presents a probabilistic grammar approach to the recognition of complex events in videos. Firstly, based on the original motion features, a rule induction algorithm is a...
Zhang Zhang, Kaiqi Huang, Tieniu Tan
CSE
2009
IEEE
15 years 6 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer
RECOMB
2009
Springer
15 years 6 months ago
Reconstructing Histories of Complex Gene Clusters on a Phylogeny
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
Tomás Vinar, Brona Brejová, Giltae S...