Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
CSCW has long been concerned with the distribution of activities in time and in space, but the problems of distributed work have often taken analytic and technical precedence. In t...
In classic InformationRetrieval systems a relevant document will not be retrieved in response to a query if the document and query representations do not share at least one term. T...
In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialo...
Denial of service attack is an attempt from any authorized or unauthorized entity to allocate resources excessively to prevent normal operation of the system. A method will be pres...