2354 search results - page 45 / 471 » Radio number for trees |
SODA
1993
ACM
14 years 11 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
CISS
2008
IEEE
15 years 4 months ago
2008
IEEE
Cognitive radio is a desirable technique for secondary users to utilize the spectrum gray space. In order to avoid intolerable interference to primary users, the transmission powe...
CCCG
2007
14 years 11 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
WSCG
2004
14 years 11 months ago
2004
This paper presents a new method for realistic real-time rendering of tree foliage. Some approaches to this problem have been presented before but the quality of their results was...
TCBB
2010
14 years 8 months ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...