2957 search results - page 130 / 592 » The Complexity of Polynomial-Time Approximation |
168
click to vote
EMNLP
2009
15 years 2 months ago
2009
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
182
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
163
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
271
Voted
AMW
2011
14 years 8 months ago
2011
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
187
click to vote
PODS
2012
ACM
13 years 7 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...