3 search results - page 1 / 1 » An Effective Hybrid Algorithm for the Circles and Spheres Pa... |
COCOA
2009
Springer
13 years 7 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
COR
2008
13 years 4 months ago
2008
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, ...
EDBT
2008
ACM
14 years 4 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...