Sciweavers

1199 search results - page 26 / 240
» Robust inference of trees
Sort
View
EOR
2008
70views more  EOR 2008»
13 years 10 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 3 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
14 years 1 months ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
ICDT
2007
ACM
105views Database» more  ICDT 2007»
14 years 1 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link
ACL
2012
12 years 12 days ago
Robust Conversion of CCG Derivations to Phrase Structure Trees
We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simp...
Jonathan K. Kummerfeld, Dan Klein, James R. Curran