Sciweavers

1998 search results - page 276 / 400
» Complexity of the Cover Polynomial
Sort
View
87
Voted
CORR
2008
Springer
89views Education» more  CORR 2008»
15 years 25 days ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
92
Voted
ECCC
2006
99views more  ECCC 2006»
15 years 23 days ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
122
Voted
JSAC
2008
105views more  JSAC 2008»
15 years 22 days ago
Vector Precoding for Wireless MIMO Systems and its Replica Analysis
This paper studies a nonlinear vector precoding scheme which inverts the wireless multiple-input multiple-output (MIMO) channel at the transmitter so that simple symbol-bysymbol de...
Ralf R. Müller, Dongning Guo, Aris L. Moustak...
112
Voted
FGCS
2007
90views more  FGCS 2007»
15 years 21 days ago
Dual-Level Key Management for secure grid communication in dynamic and hierarchical groups
Grid computing is a newly developed technology for complex systems with large-scale resource sharing and multi-institutional collaboration. The prominent feature of grid computing...
Xukai Zou, Yuan-Shun Dai, Xiang Ran
109
Voted
ORL
2008
63views more  ORL 2008»
15 years 21 days ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno