3415 search results - page 276 / 683 » Lower bounds on kernelization |
187
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
195
click to vote
ECRTS
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures...
159
click to vote
DAGM
2004
Springer
15 years 10 months ago
2004
Springer
The well-known and very simple MinOver algorithm is reformulated for incremental support vector classification with and without kernels. A modified proof for its O(t-1/2 ) converge...
208
click to vote
CATS
2008
15 years 8 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
142
click to vote
NIPS
2001
15 years 8 months ago
2001
When constructing a classifier, the probability of correct classification of future data points should be maximized. In the current paper this desideratum is translated in a very ...