Sciweavers

921 search results - page 167 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
OSDI
2008
ACM
15 years 12 months ago
Corey: An Operating System for Many Cores
Multiprocessor application performance can be limited by the operating system when the application uses the operating system frequently and the operating system services use data ...
Aleksey Pesterev, Haibo Chen, Lex Stein, M. Frans ...
FOCS
2008
IEEE
15 years 6 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
INFOVIS
2005
IEEE
15 years 5 months ago
PRISAD: A Partitioned Rendering Infrastructure for Scalable Accordion Drawing
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
James Slack, Kristian Hildebrand, Tamara Munzner
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 4 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin
PLDI
2006
ACM
15 years 5 months ago
Optimizing memory transactions
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
Timothy L. Harris, Mark Plesko, Avraham Shinnar, D...