3415 search results - page 191 / 683 » Lower bounds on kernelization |
142
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for boun...
198
click to vote
IJCNN
2006
IEEE
16 years 2 days ago
2006
IEEE
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
145
click to vote
NIPS
2007
15 years 7 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
163
Voted
FOCS
2006
IEEE
16 years 3 days ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
175
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Higher order spatial features, such as doublets or
triplets have been used to incorporate spatial information
into the bag-of-local-features model. Due to computational
limits, ...