Sciweavers

4137 search results - page 225 / 828
» On the number of matchings of a tree
Sort
View
FOCS
2004
IEEE
15 years 10 months ago
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
Lap Chi Lau
AAAI
2007
15 years 9 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
ACL
2006
15 years 8 months ago
A Comparison of Alternative Parse Tree Paths for Labeling Semantic Roles
The integration of sophisticated inference-based techniques into natural language processing applications first requires a reliable method of encoding the predicate-argument struc...
Reid Swanson, Andrew S. Gordon
CEC
2010
IEEE
15 years 7 months ago
Improving GP classification performance by injection of decision trees
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
Rikard König, Ulf Johansson, Tuve Löfstr...
ITIIS
2008
84views more  ITIIS 2008»
15 years 6 months ago
A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss
Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss amon...
Jinsuk Baek, Jehan-François Pâris