Sciweavers

351 search results - page 52 / 71
» An exact method for graph coloring
Sort
View
EGH
2010
Springer
13 years 5 months ago
Real time volumetric shadows using polygonal light volumes
This paper presents a more efficient way of computing single scattering effects in homogeneous participating media for real-time purposes than the currently popular ray-marching b...
Markus Billeter, Erik Sintorn, Ulf Assarsson
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ICOIN
2005
Springer
14 years 1 months ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...
ICCS
2004
Springer
14 years 1 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
ECCV
2006
Springer
14 years 9 months ago
Oriented Visibility for Multiview Reconstruction
Visibility estimation is arguably the most difficult problem in dense 3D reconstruction from multiple arbitrary views. In this paper, we propose a simple new approach to estimating...
Victor S. Lempitsky, Yuri Boykov, Denis V. Ivanov