1688 search results - page 66 / 338 » The Complexity of Rationalizing Matchings |
ASAP
2004
IEEE
14 years 1 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
EMNLP
2009
13 years 8 months ago
2009
In a linguistically-motivated syntax-based translation system, the entire translation process is normally carried out in two steps, translation rule matching and target sentence d...
ICSOC
2009
Springer
13 years 7 months ago
2009
Springer
The FAST gadget development environment allows users to graphically compose intelligent, i.e., semantically annotated gadgets from predefined building blocks and deploy them on var...
SIMVIS
2004
13 years 11 months ago
2004
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to m...
ALGORITHMICA
2010
13 years 10 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...