1554 search results - page 201 / 311 » Parameterized Complexity and Approximation Algorithms |
130
click to vote
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
342
click to vote
ICA
2012
Springer
13 years 10 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
114
click to vote
SIBGRAPI
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper presents a novel image-based approach to render plausible soft shadows for complex dynamic scenes with rectangular light sources. The algorithm's performance is mo...
125
click to vote
ASPDAC
2007
ACM
15 years 7 months ago
2007
ACM
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...
122
click to vote
WSC
2004
15 years 4 months ago
2004
Monte Carlo techniques have long been used (since Buffon's experiment to approximate the value of by tossing a needle onto striped paper) to analyze phenomena which, due to ...