Sciweavers

2479 search results - page 218 / 496
» Quantum complexity theory
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Low-complexity receivers for multiuser detection with an unknown number of active users
In multiuser detection, the set of users active at any time may be unknown to the receiver. A two-step detection procedure, in which multiuser detection is preceded by active-user...
Daniele Angelosante, Ezio Biglieri
CALCO
2007
Springer
89views Mathematics» more  CALCO 2007»
16 years 27 days ago
Structured Co-spans: An Algebra of Interaction Protocols
Abstract. We extend the theory of (co-)spans as a means of providing an algebraic approach to complex interactions as they arise in software-intensive systems. In order to make int...
José Luiz Fiadeiro, Vincent Schmitt
186
Voted
ECSA
2007
Springer
16 years 27 days ago
The Art and Science of Software Architecture
The past 20 years has seen significant investments in the theory and practice of software architecture. However, architectural deficiencies are frequently cited as a key factor in ...
Alan W. Brown, John A. McDermid
FSTTCS
2007
Springer
16 years 27 days ago
Undirected Graphs of Entanglement 2
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
176
Voted
ICALP
2007
Springer
16 years 26 days ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber