12519 search results - page 24 / 2504 » Approximation Problems Categories |
WWW
2007
ACM
16 years 13 days ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
EMNLP
2009
14 years 9 months ago
2009
We introduce an extension to CCG that allows form and function to be represented simultaneously, reducing the proliferation of modifier categories seen in standard CCG analyses. W...
SIGECOM
2010
ACM
14 years 12 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
ECAL
2001
Springer
15 years 4 months ago
2001
Springer
Since the concept of autopoiesis was proposed as a model of minimal living systems by Maturana and Varela, and applied to social systems by Luhmann, there has been only a few math...