Sciweavers

2498 search results - page 305 / 500
» Data Structures with Unpredictable Timing
Sort
View
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
16 years 3 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
CVPR
2009
IEEE
16 years 1 months ago
Tubular anisotropy for 2D vessel segmentation
In this paper, we present a new approach for segmentation of tubular structures in 2D images providing minimal interaction. The main objective is to extract centerlines and bounda...
Fethallah Benmansour, Laurent D. Cohen, Max W. K. ...
PPSN
1994
Springer
15 years 10 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
SIGMETRICS
2011
ACM
178views Hardware» more  SIGMETRICS 2011»
14 years 9 months ago
Soft error benchmarking of L2 caches with PARMA
The amount of charge stored in an SRAM cell shrinks rapidly with each technology generation thus increasingly exposing caches to soft errors. Benchmarking the FIT rate of caches d...
Jinho Suh, Mehrtash Manoochehri, Murali Annavaram,...
CCGRID
2007
IEEE
16 years 26 days ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li