777 search results - page 137 / 156 » A fast algorithm for the computation of an upper bound on th... |
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
3DIM
2005
IEEE
14 years 2 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
VISUALIZATION
2005
IEEE
14 years 2 months ago
2005
IEEE
For the rendering of vector and tensor fields, several texturebased volumetric rendering methods were presented in recent years. While they have indisputable merits, the classica...
EOR
2007
13 years 8 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...