Sciweavers

42230 search results - page 325 / 8446
» Algorithms and Complexity Results for
Sort
View
ICC
2007
IEEE
136views Communications» more  ICC 2007»
16 years 1 months ago
Multiple-Symbol Differential Detection Based on Combinatorial Geometry
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
Volker Pauli, Lutz H.-J. Lampe, Robert Schober, Ko...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
16 years 1 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
APVIS
2007
15 years 8 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
COMPGEOM
2006
ACM
16 years 21 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
PPL
2007
86views more  PPL 2007»
15 years 6 months ago
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency
ract problem of using P failure-prone processors to cooperatively update all locations of an N-element shared array is called Write-All. Solutions to Write-All can be used iterati...
Chryssis Georgiou, Alexander Russell, Alexander A....