3415 search results - page 517 / 683 » Lower bounds on kernelization |
155
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
Selections and actions in GUI's are often separated ? i.e. an action or command typically follows a selection. This sequence imposes a lower bound on the interaction time tha...
158
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
164
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
150
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...