262 search results - page 36 / 53 » Conformal Mapping in Linear Time |
EMSOFT
2006
Springer
14 years 1 months ago
2006
Springer
Embedded applications like video decoding, video streaming and those in the network domain, typically have a Quality of Service (QoS) requirement which needs to be met. Apart from...
SODA
2012
ACM
12 years 6 days ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
VISUALIZATION
2000
IEEE
14 years 2 months ago
2000
IEEE
We present two beneficial rendering extensions to the Projected Tetrahedra (PT) algorithm by Shirley and Tuchman. These extensions are compatible with any cell sorting technique,...
MIS
2008
Springer
13 years 9 months ago
2008
Springer
In most of the ad-hoc routing protocols, a static link lifetime (LL) is used for a newly discovered neighbors. Though this works well for networks with fixed infrastructures, it is...
JGT
2007
13 years 9 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...