We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
The modalities of search and browse dominate current thinking about interaction with the Web. Given the Web's origins as a global hypertext system, it is understandable that t...
IT/business alignment has constantly been among the top priorities for IT executives. From a prescriptive, design research perspective, our analysis of related work shows that nei...
Jan Saat, Robert Winter, Ulrik Franke, Robert Lage...
Various databases have harnessed the wealth of publicly available microarray data to address biological questions ranging from across-tissue differential expression to homologous ...
Matthew N. McCall, Karan Uppal, Harris A. Jaffee, ...
This paper addresses scene understanding in the context of a moving camera, integrating semantic reasoning ideas from monocular vision with 3D information available through struct...