Sciweavers

2354 search results - page 100 / 471
» Radio number for trees
Sort
View
ICPR
2010
IEEE
15 years 9 months ago
Detecting Faint Compact Sources Using Local Features and a Boosting Approach
Several techniques have been proposed so far in order to perform faint compact source detection in wide field interferometric radio images. However, all these methods can easily mi...
Albert Torrent, Marta Peracaula, Xavier Llado, Jor...
INFOCOM
1999
IEEE
15 years 10 months ago
Ring versus Tree Embedding for Real-time Group Multicast
In general topology networks, routing from one node to another over a tree embedded in the network is intuitively a good strategy, since it typically results in a route length of O...
Mario Baldi, Yoram Ofek
ISLPED
1996
ACM
109views Hardware» more  ISLPED 1996»
15 years 10 months ago
Transition reduction in carry-save adder trees
-- By taking advantage of the redundancy in a 4-2 compressor, we reduce the number of transitions in carry-save adder trees that are common in large multipliers. Three new 4-2 comp...
Patrik Larsson, Chris J. Nicol
ACL
1994
15 years 7 months ago
On Determining the Consistency of Partial Descriptions of Trees
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
Tom Cornell
INFOCOM
2002
IEEE
15 years 11 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic