Sciweavers

7820 search results - page 388 / 1564
» Formalization of Time and Space
Sort
View
CPC
2006
110views more  CPC 2006»
15 years 7 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
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 ...
Alexander D. Scott, Gregory B. Sorkin
CSCW
2006
ACM
15 years 7 months ago
Temporality in Medical Work: Time also Matters
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...
Madhu C. Reddy, Paul Dourish, Wanda Pratt
IR
2000
15 years 7 months ago
Exploiting the Similarity of Non-Matching Terms at Retrieval Time
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...
Fabio Crestani
AUSAI
2007
Springer
16 years 1 months ago
Dialogue Games in Defeasible Logic
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...
Subhasis Thakur, Guido Governatori, Vineet Padmana...
ACISP
1997
Springer
15 years 11 months ago
A Method to Implement a Denial of Service Protection Base
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...
Jussipekka Leiwo, Yuliang Zheng