4172 search results - page 99 / 835 » Computing Machinery and Understanding |
ACCV
2010
Springer
14 years 5 months ago
2010
Springer
Robust automatic workflow monitoring using visual sensors in industrial environments is still an unsolved problem. This is mainly due to the difficulties of recording data in work ...
131
click to vote
DALT
2010
Springer
14 years 4 months ago
2010
Springer
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
CRYPTO
2012
Springer
13 years 10 days ago
2012
Springer
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
BMCBI
2007
14 years 10 months ago
2007
Computational analysis of eukaryotic promoters is one of the most difficult problems in computational genomics and is essential for understanding gene expression profiles and reve...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...