406 search results - page 30 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
148
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
166
click to vote
ISNN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Nonlinear component analysis is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components. But th...
107
click to vote
EOR
2010
15 years 4 months ago
2010
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
126
click to vote
JAIR
2000
15 years 3 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
169
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...