Sciweavers

2542 search results - page 146 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
TIT
1998
81views more  TIT 1998»
15 years 2 months ago
Fast Iterative Coding Techniques for Feedback Channels
Abstract—A class of capacity-achieving, low-complexity, highreliability, variable-rate coding schemes is developed for communication over discrete memoryless channels with noisel...
James M. Ooi, Gregory W. Wornell
COR
2008
102views more  COR 2008»
15 years 2 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
15 years 1 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
TMI
2008
91views more  TMI 2008»
15 years 3 months ago
MRI-Based Automated Computer Classification of Probable AD Versus Normal Controls
Automated computer classification (ACC) techniques are needed to facilitate physician's diagnosis of complex diseases in individual patients. We provide an example of ACC usin...
Simon Duchesne, A. Caroli, C. Geroldi, Christian B...
DAC
2005
ACM
16 years 4 months ago
Locality-conscious workload assignment for array-based computations in MPSOC architectures
While the past research discussed several advantages of multiprocessor-system-on-a-chip (MPSOC) architectures from both area utilization and design verification perspectives over ...
Feihui Li, Mahmut T. Kandemir