Sciweavers

1552 search results - page 125 / 311
» On the Complexity of Constant Propagation
Sort
View
EGPGV
2004
Springer
165views Visualization» more  EGPGV 2004»
15 years 11 months ago
Tuning of Algorithms for Independent Task Placement in the Context of Demand-Driven Parallel Ray Tracing
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
Tomas Plachetka
INFOVIS
2003
IEEE
15 years 11 months ago
Improving Hybrid MDS with Pivot-Based Searching
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
Alistair Morrison, Matthew Chalmers
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
15 years 11 months ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
INFOCOM
2002
IEEE
15 years 11 months ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder
ICIP
2010
IEEE
15 years 4 months ago
Fast bilateral filtering by adapting block size
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
Wei Yu, Franz Franchetti, James C. Hoe, Yao-Jen Ch...