11345 search results - page 1670 / 2269 » Foundations of Computer Science |
174
click to vote
ICDM
2008
IEEE
16 years 28 days ago
2008
IEEE
Word meaning disambiguation has always been an important problem in many computer science tasks, such as information retrieval and extraction. One of the problems, faced in automa...
141
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
159
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
184
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
162
click to vote
LICS
2008
IEEE
16 years 26 days ago
2008
IEEE
We present an extension of the πI-calculus with formal sums of terms. The study of the properties of this sum reveals that its neutral element can be used to make assumptions abo...