401 search results - page 50 / 81 » Algorithms for a Simple Point Placement Problem |
102
click to vote
ICCAD
1994
IEEE
15 years 3 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
ICCV
1999
IEEE
16 years 1 months ago
1999
IEEE
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
116
click to vote
GIS
2010
ACM
14 years 9 months ago
2010
ACM
With modern LiDAR technology the amount of topographic data, in the form of massive point clouds, has increased dramatically. One of the most fundamental GIS tasks is to construct...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...