Sciweavers

3946 search results - page 204 / 790
» The computational complexity of choice sets
Sort
View
ICAC
2009
IEEE
16 years 1 months ago
Ranking the importance of alerts for problem determination in large computer systems
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhil...
WINE
2009
Springer
178views Economy» more  WINE 2009»
16 years 1 months ago
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
Yuval Emek, Michal Feldman
EUROCRYPT
2000
Springer
15 years 10 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
BMCBI
2008
104views more  BMCBI 2008»
15 years 6 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
CG
2007
Springer
15 years 6 months ago
Generalized Binet dynamics
The Binet formula provides a mechanism for the Fibonacci numbers to be viewed as a function of a complex variable. The Binet formula may be generalized by using other bases and mu...
Ning Chen, Clifford A. Reiter