2542 search results - page 234 / 509 » Computing Cartograms with Optimal Complexity |
95
Voted
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
Simulation and optimization of complex mechanical and electronical systems is a very time consuming and computationally intensive task. Therefore, metamodeling techniques are ofte...
109
Voted
ECAI
2004
Springer
15 years 6 months ago
2004
Springer
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
69
Voted
NIPS
2003
15 years 2 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
100
Voted
DCC
2010
IEEE
15 years 21 days ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
104
Voted
CAD
2006
Springer
15 years 20 days ago
2006
Springer
Presented in this paper is a sweepline algorithm to compute the Voronoi diagram of a set of circles in a two-dimensional Euclidean space. The radii of the circles are non-negative...