1322 search results - page 105 / 265 » Parameterized counting problems |
170
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
162
click to vote
TISSEC
2002
15 years 6 months ago
2002
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous so...
149
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
161
Voted
ISVC
2005
Springer
16 years 8 days ago
2005
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which leads to a family of nonlinear filters, such as the bilateral filter or the TV digi...
164
click to vote
FORMATS
2004
Springer
16 years 4 days ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...