169
Voted
COCOA
16 years 9 days ago
2007 Springer  199
Voted
COMPGEOM
15 years 8 months ago
2007 ACM 
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
160
click to vote
CAAN
16 years 10 days ago
2007 Springer 
Topological routing is basically table free, and allows for very fast restoration and thus a high level of reliability in communication. It has already been satisfactorily proposed...
178
Voted
CAAN
15 years 10 months ago
2007 Springer 
We study the efficiency of selfish routing problems in which traffic demands are revealed online. We go beyond the common Nash equilibrium concept in which possibly all players rer...
|
Discrete Geometry