3408 search results - page 364 / 682 » Logic, language, information and computation |
216
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
206
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
228
click to vote
ICDT
2010
ACM
15 years 10 months ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
188
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
178
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes a generic mechanism to migrate threads in heterogeneous distributed environments. To maintain high portability and flexibility, thread migration is implement...