Sciweavers

4797 search results - page 353 / 960
» The complexity of partition tasks
Sort
View
DEXA
2005
Springer
80views Database» more  DEXA 2005»
16 years 7 days ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu
ERLANG
2004
ACM
16 years 4 days ago
Structured programming using processes
Structured Programming techniques are applied to a personal accounting software application implemented in erlang as a demonstration of the utility of processes as design construc...
Jay Nelson
SIGOPSE
2004
ACM
16 years 4 days ago
QoS for internet services: done right
In this paper we argue that the best approach to providing Quality of Service (QoS) guarantees to current Internet services is to use admission control and traffic shaping techni...
Josep M. Blanquer, Antoni Batchelli, Klaus E. Scha...
WMPI
2004
ACM
16 years 4 days ago
Cache organizations for clustered microarchitectures
Clustered microarchitectures are an effective organization to deal with the problem of wire delays and complexity by partitioning some of the processor resources. The organization ...
José González, Fernando Latorre, Ant...
182
Voted
CODES
2003
IEEE
16 years 14 hour ago
A codesigned on-chip logic minimizer
Boolean logic minimization is traditionally used in logic synthesis tools running on powerful desktop computers. However, logic minimization has recently been proposed for dynamic...
Roman L. Lysecky, Frank Vahid