Sciweavers

8824 search results - page 1381 / 1765
» On the Complexity of Real Functions
Sort
View
FOCS
2007
IEEE
16 years 1 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
ICC
2007
IEEE
149views Communications» more  ICC 2007»
16 years 1 months ago
Reliability-based Partial Parallel Interference Cancellation and Iterative Decoding for DS-CDMA over Fading Channels
—Multistage Partial Parallel Interference Cancellation (PPIC) is proposed for Turbo-encoded DS-CDMA systems where the partial cancellation factors are derived based on the Loglik...
Ayman Elezabi
ICC
2007
IEEE
130views Communications» more  ICC 2007»
16 years 1 months ago
Off-network Control for Scalable Routing in Very Large Sensor Networks
—This paper presents an architectural solution to address the problem of scalable routing in very large sensor networks. The control complexities of the existing sensor routing p...
Tao Wu, Subir K. Biswas
ICC
2007
IEEE
16 years 1 months ago
Power Managed Packet Switching
— High power dissipation in packet switches and routers is fast turning into a key problem, owing to increasing line speeds and decreasing chip sizes. To address this issue, we i...
Aditya Dua, Benjamin Yolken, Nicholas Bambos
ICC
2007
IEEE
16 years 1 months ago
Detection of Frequency-Hopped Waveforms Embedded in Interference Waveforms with Noise
—Bandwidth usage has become more complex such that it is not uncommon that multiple signals of appreciable power may be present within the same bandwidth. The presence of multipl...
John Weber, Kyle Kowalske, Clark Robertson, Frank ...
« Prev « First page 1381 / 1765 Last » Next »