Sciweavers

1256 search results - page 220 / 252
» Compositional Memory Systems for Data Intensive Applications
Sort
View
132
Voted
TPDS
2002
126views more  TPDS 2002»
15 years 3 days ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
131
Voted
CONIELECOMP
2011
IEEE
14 years 4 months ago
FPGA design and implementation for vertex extraction of polygonal shapes
This work focuses on developing systems of blocks in SIMULINK and VHDL to reuse on design of applications involving the recognition of polygonal objects. Usage of this work reduce...
Jorge Martínez-Carballido, Jorge Guevara-Es...
101
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 6 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
BIBE
2008
IEEE
203views Bioinformatics» more  BIBE 2008»
15 years 7 months ago
A study of the parameters affecting minimum detectable activity concentration level of clinical LSO PET scanners
— Recent studies in the field of molecular imaging have demonstrated the need for PET probes capable of imaging very weak activity distributions. Over this range of applications ...
Nicolas A. Karakatsanis, Konstantina S. Nikita
ICRA
2002
IEEE
188views Robotics» more  ICRA 2002»
15 years 5 months ago
Hybrid Mobile Robot Localization using Switching State-Space Models
—This article describes a rigorous and complete framework for the simultaneous localization and map building problem for mobile robots: the symmetries and perturbations map (SPma...
Haris Baltzakis, Panos E. Trahanias