Sciweavers

462 search results - page 2 / 93
» Covering a Tree by a Forest
Sort
View
ECAI
2008
Springer
13 years 7 months ago
MTForest: Ensemble Decision Trees based on Multi-Task Learning
Many ensemble methods, such as Bagging, Boosting, Random Forest, etc, have been proposed and widely used in real world applications. Some of them are better than others on noisefre...
Qing Wang, Liang Zhang, Mingmin Chi, Jiankui Guo
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
13 years 5 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
ICALP
2010
Springer
13 years 10 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
ICAT
2003
IEEE
13 years 10 months ago
Interactive 3-D Visualization of Real Forests
Forest resource management systems and forest landscape visualization applications often need usersteered interactive displays of a forest landscape representing the underlying fo...
Qizhi Yu, Chongcheng Chen, Zhigeng Pan, Tianhe Chi
IPL
2008
114views more  IPL 2008»
13 years 5 months ago
Faster algorithms for guided tree edit distance
The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F and G such that a thi...
Dekel Tsur