Sciweavers

3396 search results - page 155 / 680
» Tree representations of graphs
Sort
View
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
13 years 7 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
AAAI
2007
13 years 11 months ago
Learning Voting Trees
Binary voting trees provide a succinct representation for a large and prominent class of voting rules. In this paper, we investigate the PAC-learnability of this class of rules. W...
Ariel D. Procaccia, Aviv Zohar, Yoni Peleg, Jeffre...
FOCS
2006
IEEE
14 years 3 months ago
Minimum Bounded Degree Spanning Trees
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
Michel X. Goemans
AHSWN
2008
92views more  AHSWN 2008»
13 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
FLAIRS
2006
13 years 10 months ago
Using Enhanced Concept Map for Student Modeling in Programming Tutors
We have been using the concept map of the domain, enhanced with pedagogical concepts called learning objectives, as the overlay student model in our intelligent tutors for program...
Amruth N. Kumar