137 search results - page 22 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
IWMM
2007
Springer
14 years 2 months ago
2007
Springer
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
IWMM
2010
Springer
13 years 9 months ago
2010
Springer
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
NIPS
2007
13 years 9 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...