149 search results - page 7 / 30 » Crossing Numbers and Parameterized Complexity |
NIPS
2004
13 years 8 months ago
2004
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
CAD
2004
Springer
13 years 7 months ago
2004
Springer
This paper presents a novel approach for 3D surface filtering over two-manifold meshes. A robust spherical parameterization algorithm is proposed to transform the input surface in...
ISPDC
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper, we propose SKAIT, a parameterized symmetric key pre-distribution scheme that guarantees a secure and confidential channel between every pair of nodes in a wirele...
IWPEC
2004
Springer
14 years 25 days 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...
MST
2007
13 years 7 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...