Sciweavers

4325 search results - page 555 / 865
» Incremental computation with names
Sort
View
VISUALIZATION
2000
IEEE
15 years 11 months ago
On-the-Fly rendering of losslessly compressed irregular volume data
Very large irregular-grid data sets are represented as tetrahedral meshes and may incur significant disk I/O access overhead in the rendering process. An effective way to allevia...
Chuan-Kai Yang, Tulika Mitra, Tzi-cker Chiueh
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 11 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
SIGOPSE
1998
ACM
15 years 11 months ago
Nested Java processes: OS structure for mobile code
The majority of work on protection in single-language mobile code environments focuses on information security issues and depends on the language environment for solutions to the ...
Patrick Tullmann, Jay Lepreau
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 11 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...