2233 search results - page 173 / 447 » On the Complexity of Theory Curbing |
189
click to vote
ASWC
2009
Springer
15 years 9 months ago
2009
Springer
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
170
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
149
click to vote
CORR
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we introduce a general framework for defining the depth of a sequence with respect to a class of observers. We show that our general framework captures all depth not...
151
click to vote
IFIP12
2008
15 years 8 months ago
2008
Go is a strategic two player boardgame of Chinese origin. In terms of game theory, it is a deterministic perfect information game. But despite of these factors it is terribly comp...
127
click to vote
NAACL
2007
15 years 7 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...