Sciweavers

2297 search results - page 185 / 460
» Production of Large Computer Programs
Sort
View
IDEAS
2008
IEEE
105views Database» more  IDEAS 2008»
16 years 1 months ago
Pruning attribute values from data cubes with diamond dicing
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to...
Hazel Webb, Owen Kaser, Daniel Lemire
DAC
1997
ACM
15 years 11 months ago
A Graph-Based Synthesis Algorithm for AND/XOR Networks
In this paper, we introduce a Shared Multiple Rooted XORbased Decomposition Diagram XORDD to represent functions with multiple outputs. Based on the XORDD representation, we dev...
Yibin Ye, Kaushik Roy
207
Voted
COOPIS
2002
IEEE
15 years 12 months ago
Efficient Querying of Distributed Resources in Mediator Systems
: This work investigates the integration of heterogeneous resources, such as data and programs, in a fully distributed peer-to-peer mediation architecture. The challenge in making ...
Ioana Manolescu, Luc Bouganim, Françoise Fa...
ICALP
2005
Springer
16 years 16 days ago
Noisy Turing Machines
Abstract. Turing machines exposed to a small stochastic noise are considered. An exact characterisation of their (≈ Π0 2 ) computational power (as noise level tends to 0) is obt...
Eugene Asarin, Pieter Collins
ICCS
2003
Springer
16 years 6 days ago
Exploiting Stability to Reduce Time-Space Cost for Memory Tracing
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
Xiaofeng Gao, Allan Snavely