3415 search results - page 666 / 683 » Lower Bounds for Kernelizations |
GRAPHICSINTERFACE
2004
13 years 11 months ago
2004
Today's hardware graphics accelerators incorporate techniques to antialias edges and minimize geometry-related sampling artifacts. Two such techniques, brute force supersampl...
SIROCCO
2004
13 years 11 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
ICISC
1998
13 years 11 months ago
1998
Abstract. In this paper, we introduce the concept of kth-order nonhomomorphicity of mappings or S-boxes as an alternative indicator that forecasts nonlinearity characteristics of a...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
ADHOC
2007
13 years 10 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...