Sciweavers

1449 search results - page 86 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
15 years 10 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
REX
1991
15 years 10 months ago
The Theory of Timed Automata
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
Rajeev Alur, David L. Dill
CBMS
2005
IEEE
15 years 8 months ago
Biclustering of Expression Data Using Simulated Annealing
In gene expression data a bicluster is a subset of genes and a subset of conditions which show correlating levels of expression. However, the problem of finding significant biclu...
Kenneth Bryan, Padraig Cunningham, Nadia Bolshakov...
AAAI
2010
15 years 8 months ago
Complexity of Computing Optimal Stackelberg Strategies in Security Resource Allocation Games
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
Dmytro Korzhyk, Vincent Conitzer, Ronald Parr
ECIR
2007
Springer
15 years 8 months ago
Personalized Communities in a Distributed Recommender System
The amount of data exponentially increases in information systems and it becomes more and more difficult to extract the most relevant information within a very short time. Among ot...
Sylvain Castagnos, Anne Boyer