387 search results - page 5 / 78 » Towards in-place geometric algorithms and data structures |
ICCAD
2003
IEEE
15 years 9 months ago
2003
IEEE
As the size and complexity of VLSI circuits increase, the need for faster floorplanning algorithms also grows. In this work we introduce Traffic, a new method for creating wire- a...
114
click to vote
FTTCS
2006
15 years 10 days ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
112
Voted
FSKD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of ...
PKDD
2007
Springer
15 years 6 months ago
2007
Springer
Most knowledge discovery processes are biased since some part of the knowledge structure must be given before extraction. We propose a framework that avoids this bias by supporting...
105
click to vote
CCCG
2010
15 years 1 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...