Sciweavers

6142 search results - page 448 / 1229
» The Complexity of Partition Functions
Sort
View
SIBGRAPI
2005
IEEE
16 years 12 days ago
Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees
Point-based modeling and rendering is an active area of research in Computer Graphics. The concept of points with attributes (e.g. normals) is usually referred to as surfels, and ...
Marcus A. C. Farias, Carlos Eduardo Scheidegger, J...
DEXA
2005
Springer
80views Database» more  DEXA 2005»
16 years 11 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 8 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 7 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 7 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...