1871 search results - page 71 / 375 » The Ephemeral Pairing Problem |
164
click to vote
IJCPOL
2008
15 years 6 months ago
2008
One of the unique challenges to Chinese Language Processing is cross-strait named entity recognition. Due to the adoption of different transliteration strategies, foreign name tra...
226
click to vote
WSDM
2012
ACM
14 years 2 months ago
2012
ACM
We describe a open-domain information extraction method for extracting concept-instance pairs from an HTML corpus. Most earlier approaches to this problem rely on combining cluste...
191
click to vote
ACL
2012
13 years 9 months ago
2012
Learning for sentence re-writing is a fundamental task in natural language processing and information retrieval. In this paper, we propose a new class of kernel functions, referre...
159
Voted
ISAAC
2005
Springer
16 years 8 days ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
165
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...