446 search results - page 37 / 90 » Learning discrete categorial grammars from structures |
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...
COLING
2008
13 years 9 months ago
2008
Bracketing Transduction Grammar (BTG) is a natural choice for effective integration of desired linguistic knowledge into statistical machine translation (SMT). In this paper, we p...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...