Sciweavers

820 search results - page 109 / 164
» Inducing Temporal Graphs
Sort
View
AIPS
2008
15 years 5 months ago
Structural Patterns Heuristics via Fork Decomposition
We consider a generalization of the PDB homomorphism abstractions to what is called "structural patterns". The bais in abstracting the problem in hand into provably trac...
Michael Katz, Carmel Domshlak
111
Voted
NIPS
2007
15 years 4 months ago
Semi-Supervised Multitask Learning
A semi-supervised multitask learning (MTL) framework is presented, in which M parameterized semi-supervised classifiers, each associated with one of M partially labeled data mani...
Qiuhua Liu, Xuejun Liao, Lawrence Carin
EMNLP
2006
15 years 4 months ago
Two graph-based algorithms for state-of-the-art WSD
This paper explores the use of two graph algorithms for unsupervised induction and tagging of nominal word senses based on corpora. Our main contribution is the optimization of th...
Eneko Agirre, David Martínez, Oier Lopez de...
NIPS
2003
15 years 4 months ago
Bias-Corrected Bootstrap and Model Uncertainty
The bootstrap has become a popular method for exploring model (structure) uncertainty. Our experiments with artificial and realworld data demonstrate that the graphs learned from...
Harald Steck, Tommi Jaakkola
AML
2005
84views more  AML 2005»
15 years 3 months ago
Modularity of proof-nets
When we cut a multiplicative proof-net of linear logic in two parts we get two modules with a certain border. We call pretype of a module the set of partitions over its border indu...
Roberto Maieli, Quintijn Puite