Sciweavers

7978 search results - page 330 / 1596
» Combining shared-coin algorithms
Sort
View
APLAS
2011
ACM
14 years 5 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
CIKM
2011
Springer
14 years 5 months ago
Detecting anomalies in graphs with numeric labels
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
Michael Davis, Weiru Liu, Paul Miller, George Redp...
CORR
2012
Springer
192views Education» more  CORR 2012»
14 years 23 days ago
The best of both worlds: stochastic and adversarial bandits
We present a bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specifical...
Sébastien Bubeck, Aleksandrs Slivkins
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 7 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
ICML
2007
IEEE
16 years 5 months ago
Intractability and clustering with constraints
Clustering with constraints is a developing area of machine learning. Various papers have used constraints to enforce particular clusterings, seed clustering algorithms and even l...
Ian Davidson, S. S. Ravi