Sciweavers

1529 search results - page 266 / 306
» A slant removal algorithm
Sort
View
VLDB
1997
ACM
126views Database» more  VLDB 1997»
14 years 26 days ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
SIGGRAPH
1993
ACM
14 years 24 days ago
Hierarchical Z-buffer visibility
An ideal visibility algorithm should a) quickly reject most of the hidden geometry in a model and b) exploit the spatial and perhaps temporal coherence of the images being generat...
Ned Greene, Michael Kass, Gavin S. P. Miller
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
14 years 24 days ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
CCS
2006
ACM
14 years 14 days ago
Resiliency policies in access control
We introduce the notion of resiliency policies in the context of access control systems. Such policies require an access control system to be resilient to the absence of users. An...
Ninghui Li, Mahesh V. Tripunitara, Qihua Wang
COMAD
2008
13 years 10 months ago
CUM: An Efficient Framework for Mining Concept Units
Web is the most important repository of different kinds of media such as text, sound, video, images etc. Web mining is the process of applying data mining techniques to automatica...
Santhi Thilagam