1484 search results - page 116 / 297 » Ants meeting algorithms |
86
Voted
SIGGRAPH
1995
ACM
15 years 1 months ago
1995
ACM
In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method ensures that just enough work is done to meet th...
DAC
2005
ACM
14 years 12 months ago
2005
ACM
We present BonnPlace, a new VLSI placement algorithm that combines the advantages of analytical and partitioning-based placers. Based on (non-disjoint) placements minimizing the t...
ECCV
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggest...
CISIM
2008
IEEE
15 years 4 months ago
2008
IEEE
Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all...
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...