Sciweavers

1120 search results - page 111 / 224
» Parallel Algorithmic Techniques for Combinatorial Computatio...
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 1 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
TSP
2008
110views more  TSP 2008»
13 years 8 months ago
Blind Deconvolution of DS-CDMA Signals by Means of Decomposition in Rank-(1, L, L) Terms
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
Lieven De Lathauwer, Alexandre de Baynast
IPPS
1999
IEEE
14 years 1 months ago
A Robust Adaptive Metric for Deadline Assignment in Heterogeneous Distributed Real-Time Systems
In a real-time system, tasks are constrained by global endto-end (E-T-E) deadlines. In order to cater for high task schedulability, these deadlines must be distributed over compon...
Jan Jonsson
ISCAS
2007
IEEE
123views Hardware» more  ISCAS 2007»
14 years 3 months ago
An Organic Computing architecture for visual microprocessors based on Marching Pixels
—The paper presents architecture and synthesis results for an organic computing hardware for smart CMOS camera chips. The organic behavior in the chip hardware is based on distri...
Dietmar Fey, Marcus Komann, Frank Schurz, Andreas ...
IPPS
2010
IEEE
13 years 7 months ago
Adapting cache partitioning algorithms to pseudo-LRU replacement policies
Abstract-- Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of Service (QoS) in CMP processors. The cache par...
Kamil Kedzierski, Miquel Moretó, Francisco ...