Sciweavers

204 search results - page 5 / 41
» Fast Set Operations Using Treaps
Sort
View
DAC
2006
ACM
14 years 1 months ago
High-performance operating system controlled memory compression
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed ...
Lei Yang, Haris Lekatsas, Robert P. Dick
FAST
2009
13 years 4 months ago
On Explicit Provenance Management in RDF/S Graphs
The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. In this paper, we argue that named graphs alone can...
Panagiotis Pediaditis, Giorgos Flouris, Irini Fund...
HEURISTICS
2000
127views more  HEURISTICS 2000»
13 years 7 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
FDG
2009
ACM
14 years 1 months ago
Very fast action selection for parameterized behaviors
In this paper, I will discuss a set of techniques for supporting limited variable binding in behavior-based systems. This adds additional useful expressivity while preserving the ...
Ian Horswill
TVCG
2010
156views more  TVCG 2010»
13 years 5 months ago
Yet Faster Ray-Triangle Intersection (Using SSE4)
—Ray-triangle intersection is an important algorithm, not only in the field of realistic rendering (based on ray tracing), but also in physics simulation, collision detection, m...
Jirí Havel, Adam Herout