815 search results - page 83 / 163 » Approximate Entropy Reducts |
105
click to vote
COCO
2009
Springer
15 years 6 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...
98
Voted
JAT
2010
14 years 10 months ago
2010
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
We present an algorithm for illumination invariant 3D model based tracking and video compression. While model-based coding schemes are well developed, the compression rate reduces...
110
click to vote
IWPEC
2004
Springer
15 years 5 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...