Sciweavers

2354 search results - page 49 / 471
» Radio number for trees
Sort
View
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
15 years 1 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
VLDB
2006
ACM
162views Database» more  VLDB 2006»
15 years 10 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
IJAC
2007
89views more  IJAC 2007»
14 years 9 months ago
Bounding Right-Arm Rotation Distances
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...
Sean Cleary, Jennifer Taback
WINET
2010
120views more  WINET 2010»
14 years 8 months ago
Link adaptation algorithms for improved delivery of delay- and error-sensitive packet-data services over wireless networks
Abstract Link Adaptation is a radio resource management technique that assesses the channel conditions and selects a transport mode, from a set of possible options, which is optimi...
Miguel López-Benítez, Javier Goz&aac...
USS
2010
14 years 7 months ago
Realization of RF Distance Bounding
One of the main obstacles for the wider deployment of radio (RF) distance bounding is the lack of platforms that implement these protocols. We address this problem and we build a ...
Kasper Bonne Rasmussen, Srdjan Capkun