199 search results - page 30 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
CIAC
2006
Springer
14 years 9 days ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
ISSAC
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
IMR
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...
DAM
2011
13 years 3 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...