1390 search results - page 183 / 278 » Computing the depth of a flat |
TCS
2008
14 years 9 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
CGF
2002
14 years 9 months ago
2002
This paper describes how technical illustrations containing opaque and non-opaque objects can be automatically generated. Traditional methods to show transparency in manual drawin...
108
click to vote
CC
2008
Springer
14 years 9 months ago
2008
Springer
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
VC
2010
14 years 8 months ago
2010
In this paper we propose a novel technique to perform real-time rendering of translucent inhomogeneous materials, one of the most well known problems of Computer Graphics. The deve...
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...