Sciweavers

61 search results - page 11 / 13
» Pointed Binary Encompassing Trees
Sort
View
WACV
2005
IEEE
14 years 1 months ago
Image Segmentation by Unsupervised Sparse Clustering
In this paper, we present a novel solution of image segmentation based on positiveness by regarding the segmentation as one of the graph-theoretic clustering problems. On the cont...
Byoung-Ki Jeon, Yun-Beom Jung, Ki-Sang Hong
VVS
2000
IEEE
171views Visualization» more  VVS 2000»
13 years 12 months ago
Fast CSG voxelization by frame buffer pixel mapping
This paper describes a fast algorithm for the volume conversion and rendering of CSG models constructed from both geometric and volumetric primitives. Using 3D texture mapping and...
Shiaofen Fang, Duoduo Liao
ICALP
1994
Springer
13 years 11 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
MFCS
2000
Springer
13 years 11 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks
DAC
1997
ACM
13 years 11 months ago
More Practical Bounded-Skew Clock Routing
: Academic clock routing research results has often had limited impact on industry practice, since such practical considerations as hierarchical buffering, rise-time and overshoot ...
Andrew B. Kahng, Chung-Wen Albert Tsao