1972 search results - page 58 / 395 » connection 2008 |
ML
2008
ACM
13 years 8 months ago
2008
ACM
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
RSA
2008
13 years 8 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
CGF
2007
13 years 8 months ago
2007
We present a new, single-rate method for compressing the connectivity information of a connected 2-manifold triangle mesh with or without boundary. Traditional compression schemes...
GMP
2008
IEEE
14 years 2 months ago
2008
IEEE
Surface parameterization is a fundamental tool in geometric modeling and processing. Most existing methods deal with simply connected disks. This work introduces a novel method to ...