Sciweavers

895 search results - page 59 / 179
» Using graphs for some discrete tomography problems
Sort
View
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 11 months ago
Graph-Based Decoding in the Presence of ISI
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...
Mohammad H. Taghavi, Paul H. Siegel
DGCI
2009
Springer
14 years 2 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 3 months ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
TIT
2008
97views more  TIT 2008»
13 years 11 months ago
Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets
The problem of predicting a sequence x ; x ; . . . generated by a discrete source with unknown statistics is considered. Each letter x is predicted using the information on the wor...
Boris Ryabko, Jaakko Astola, Alexander Gammerman