974 search results - page 60 / 195 » pairing 2010 |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
ICIAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Multi-scale aggregates are composed of particles which results themselves of agglomeration of other primary particles. If particles are modeled by their centers, the geom...
IPL
2010
13 years 8 months ago
2010
The Floyd-Warshall algorithm is a simple and widely used algorithm to compute shortest paths between all pairs of vertices in an edge weighted directed graph. It can also be used ...
MICAI
2010
Springer
13 years 8 months ago
2010
Springer
We present our experiments on Recognizing Textual Entailment based on modeling the entailment relation as a classification problem. As features used to classify the entailment pair...
ACL
2010
13 years 8 months ago
2010
This paper proposes new algorithms to compute the sense similarity between two units (words, phrases, rules, etc.) from parallel corpora. The sense similarity scores are computed ...