4137 search results - page 330 / 828 » On the number of matchings of a tree |
280
Voted
ICDE
1998
IEEE
16 years 8 months ago
1998
IEEE
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
165
click to vote
FLAIRS
2004
15 years 8 months ago
2004
The Federal Highway Administration (FHWA) Office of Highway Planning requires states to furnish vehicle classification data as part of the Highway Performance Monitoring Systems (...
206
click to vote
SPAA
2004
ACM
16 years 8 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
185
click to vote
ACL
2008
15 years 8 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
183
Voted
JCT
2008
15 years 6 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...