4047 search results - page 94 / 810 » The Discrete Basis Problem |
TCS
2008
13 years 10 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
AFRICACRYPT
2010
Springer
14 years 4 months ago
2010
Springer
This paper describes an implementation of Pollard’s rho algorithm to compute the elliptic curve discrete logarithm for the Synergistic Processor Elements of the Cell Broadband En...
ICCAD
2003
IEEE
14 years 6 months ago
2003
IEEE
Detailed electromagnetic analysis of three-dimensional structures in multilayered dielectric media is critical for automatic generation of equivalent circuit models for the interc...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...