5105 search results - page 144 / 1021 » Approximate Structural Consistency |
117
Voted
ACL
2004
15 years 5 months ago
2004
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
114
Voted
IJCAI
1989
15 years 4 months ago
1989
This theory on semi-equivalence r e l a t i o n s is an important and useful tool for i n v e s t i g a t i n g c l a s s i f i c a t i o n , pattern r e c o g n i t i o n , p o l...
151
Voted
CCE
2005
15 years 3 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
117
Voted
SIAMCOMP
2000
15 years 3 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
171
Voted
WINE
2010
Springer
15 years 1 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...