Sciweavers

3360 search results - page 175 / 672
» Opportunistic Data Structures with Applications
Sort
View
COMPGEOM
2001
ACM
15 years 7 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
ASPLOS
2010
ACM
15 years 10 months ago
COMPASS: a programmable data prefetcher using idle GPU shaders
A traditional fixed-function graphics accelerator has evolved into a programmable general-purpose graphics processing unit over the last few years. These powerful computing cores...
Dong Hyuk Woo, Hsien-Hsin S. Lee
ASPLOS
2010
ACM
15 years 11 months ago
MacroSS: macro-SIMDization of streaming applications
SIMD (Single Instruction, Multiple Data) engines are an essential part of the processors in various computing markets, from servers to the embedded domain. Although SIMD-enabled a...
Amir Hormati, Yoonseo Choi, Mark Woh, Manjunath Ku...
BMCBI
2008
112views more  BMCBI 2008»
15 years 4 months ago
A general modeling and visualization tool for comparing different members of a group: application to studying tau-mediated regul
Background: Innumerable biological investigations require comparing collections of molecules, cells or organisms to one another with respect to one or more of their properties. Al...
Arnab Bhattacharya, Sasha Levy, Adria LeBoeuf, Mic...
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 8 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...