Sciweavers

2257 search results - page 279 / 452
» Secure program partitioning
Sort
View
ICALP
2010
Springer
14 years 8 days ago
Resource Oblivious Sorting on Multicores
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...
Richard Cole, Vijaya Ramachandran
DAC
2005
ACM
14 years 7 days ago
Modular domain-specific implementation and exploration framework for embedded software platforms
This paper focuses on designing network processing software for embedded processors. Our design flow CRACC represents an efficient path to implementation based on a modular applic...
Christian Sauer, Matthias Gries, Sören Sonnta...
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
13 years 11 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
MIC
2003
116views Control Systems» more  MIC 2003»
13 years 11 months ago
On the Linear Quadratic Minimum-fuel Problem
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
H. Benazza, N. El Alami
ISMB
2000
13 years 11 months ago
A Practical Algorithm for Optimal Inference of Haplotypes from Diploid Populations
The next phase of human genomics will involve largescale screens of populations for signi cant DNA polymorphisms, notably single nucleotide polymorphisms SNP's. Dense human S...
Dan Gusfield