17760 search results - page 3388 / 3552 » A Generalization of the Massey-Ding Algorithm |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We investigate the extent to which price updates can increase the revenue of a seller with little prior information on demand. We study prior-free revenue maximization for a selle...