Sciweavers

4714 search results - page 363 / 943
» The Complexity of Iterated Multiplication
Sort
View
PR
2011
14 years 9 months ago
Detecting and discriminating behavioural anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempo...
Chen Change Loy, Tao Xiang, Shaogang Gong

Publication
363views
14 years 5 months ago
Detecting and Discriminating Behavioural Anomalies
This paper aims to address the problem of anomaly detection and discrimination in complex behaviours, where anomalies are subtle and difficult to detect owing to the complex tempor...
Chen Change Loy, Tao Xiang, Shaogang Gong
ATAL
2010
Springer
15 years 7 months ago
Pure Nash equilibria: complete characterization of hard and easy graphical games
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
Albert Xin Jiang, MohammadAli Safari
IACR
2011
127views more  IACR 2011»
14 years 6 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
BMCBI
2010
115views more  BMCBI 2010»
15 years 6 months ago
Multiconstrained gene clustering based on generalized projections
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
Jia Zeng, Shanfeng Zhu, Alan Wee-Chung Liew, Hong ...