1760 search results - page 332 / 352 » Learning from Partial Observations |
CCO
2001
Springer
14 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
LREC
2008
13 years 11 months ago
2008
The availability of a huge mass of textual data in electronic format has increased the need for fast and accurate techniques for textual data processing. Machine learning and stat...
ACL
2001
13 years 11 months ago
2001
A hybrid system is described which combines the strength of manual rulewriting and statistical learning, obtaining results superior to both methods if applied separately. The comb...
CIDR
2003
13 years 11 months ago
2003
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
SDM
2003
SIAM
13 years 11 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...