1452 search results - page 170 / 291 » Algorithmic Analysis of Array-Accessing Programs |
124
Voted
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
If we classify the variables of a program into various security levels, then a secure information flow analysis aims to verify statically that information in the program can flo...
107
Voted
COMPSAC
2007
IEEE
15 years 4 months ago
2007
IEEE
Despite the availability of a variety of program analysis tools, evaluation of these tools is difficult, as only few benchmark suites exist. Existing benchmark suites lack the uni...
106
Voted
JMLR
2012
13 years 3 months ago
2012
We develop a new tool for data-dependent analysis of the exploration-exploitation trade-off in learning under limited feedback. Our tool is based on two main ingredients. The fi...
154
click to vote
JMLR
2012
13 years 3 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
103
Voted
JGO
2010
14 years 7 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...