2436 search results - page 292 / 488 » Comonadic Notions of Computation |
179
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
197
click to vote
CAISE
2006
Springer
15 years 10 months ago
2006
Springer
The evolution of mobile technologies, like web-enable cellphones, PDAs and wireless networks, makes it now possible to use these technologies for collaborative work through web-bas...
173
click to vote
COCO
2006
Springer
15 years 10 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
195
click to vote
ICDE
2000
IEEE
15 years 10 months ago
2000
IEEE
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
144
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...