Sciweavers

2778 search results - page 16 / 556
» Limit complexities revisited
Sort
View
ICC
2009
IEEE
105views Communications» more  ICC 2009»
14 years 7 months ago
Reflected Simplex Codebooks for Limited Feedback MIMO Beamforming
This paper proposes Reflected Simplex codebooks for limited feedback beamforming in multiple-input multipleoutput (MIMO) wireless systems. The codebooks are a geometric constructio...
Daniel J. Ryan, Iain B. Collings, Jean-Marc Valin
ICALP
2009
Springer
15 years 10 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi
CP
2006
Springer
15 years 1 months ago
Constraint Satisfaction with Bounded Treewidth Revisited
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
Marko Samer, Stefan Szeider
KBSE
2009
IEEE
15 years 4 months ago
Service Substitution Revisited
The current state of the art concerning the problem of service substitution raises the following issue: the complexity of the substitution process scales up with the number of ava...
Dionysis Athanasopoulos, Apostolos Zarras, Val&eac...
HICSS
2003
IEEE
130views Biometrics» more  HICSS 2003»
15 years 3 months ago
An Integrative Implementation Framework for Electronic Customer Relationship Management: Revisiting the General Principles of Us
Electronic Customer Relationship Management (eCRM) has become the latest paradigm in the world of Customer Relationship Management. Recent business surveys suggest that up to 50% ...
Jerry Fjermestad, Nicholas C. Romano Jr.