Sciweavers

2498 search results - page 266 / 500
» Data Structures with Unpredictable Timing
Sort
View
DAM
2007
105views more  DAM 2007»
15 years 6 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 6 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
IMCSIT
2010
15 years 4 months ago
Finding Patterns in Strings using Suffixarrays
Abstract--Finding regularities in large data sets requires implementations of systems that are efficient in both time and space requirements. Here, we describe a newly developed sy...
Herman Stehouwer, Menno van Zaanen
ICASSP
2009
IEEE
15 years 4 months ago
A PARAFAC-based technique for detection and localization of multiple targets in a MIMO radar system
In this paper, we show that the problem of detection and localization of multiple targets in a bistatic MIMO radar system can be solved by Parallel Factor (PARAFAC) analysis. Our ...
Dimitri Nion, Nicholas D. Sidiropoulos
CPHYSICS
2011
200views Education» more  CPHYSICS 2011»
15 years 1 months ago
Adaptable Particle-in-Cell algorithms for graphical processing units
We developed new parameterized Particle-in-Cell algorithms and data structures for emerging multi-core and many-core architectures. Four parameters allow tuning of this PIC code t...
Viktor K. Decyk, Tajendra V. Singh