Sciweavers

8496 search results - page 165 / 1700
» Problem Solving and Complex Systems
Sort
View
JCT
2007
90views more  JCT 2007»
13 years 9 months ago
Enumeration problems for classes of self-similar graphs
We describe a general construction principle for a class of self-similar graphs. For various enumeration problems, we show that this construction leads to polynomial systems of rec...
Elmar Teufl, Stephan Wagner
TSP
2008
147views more  TSP 2008»
13 years 9 months ago
Low-Complexity MIMO Multiuser Receiver: A Joint Antenna Detection Scheme for Time-Varying Channels
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
Charlotte Dumard, Thomas Zemen
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
AML
2007
95views more  AML 2007»
13 years 9 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
GMP
2006
IEEE
114views Solid Modeling» more  GMP 2006»
14 years 3 months ago
A Step Towards Automated Design of Side Actions in Injection Molding of Complex Parts
Side actions contribute to mold cost by resulting in an additional manufacturing and assembly cost as well as by increasing the molding cycle time. Therefore, generating shapes of ...
Ashis Gopal Banerjee, Satyandra K. Gupta