2168 search results - page 46 / 434 » Randomized Algorithms and Complexity Theory |
115
Voted
CIMAGING
2009
15 years 12 days ago
2009
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we present a rigorous treatment of a classical demosaicking algorithm based on alternatin...
122
Voted
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
164
Voted
FOGA
2011
14 years 6 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
138
Voted
ICCAD
2009
IEEE
15 years 10 days ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
161
Voted
JMLR
2008
15 years 2 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...