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...
Abstract We propose an approach to texture boundary detection that only requires a line-search in the direction normal to the edge. It is therefore very fast and can be incorporate...
Recreating the temporal illumination variations of natural scenes has great potential for realistic synthesis of video sequences. In this paper, we present a 3D (model-based) appr...