721 search results - page 61 / 145 » Almost universal graphs |
107
click to vote
ICALP
2009
Springer
16 years 5 days ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
103
click to vote
SODA
1992
ACM
15 years 1 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
ICIP
2009
IEEE
16 years 29 days ago
2009
IEEE
The aim of color constancy is to remove the effect of the color of the light source. Since color constancy is inherently an ill-posed problem, different assumptions have been prop...
105
click to vote
ALT
2007
Springer
15 years 8 months ago
2007
Springer
It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
EDBT
2009
ACM
15 years 6 months ago
2009
ACM
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...