15 search results - page 3 / 3 » Constraint Complexity of Realizations of Linear Codes on Arb... |
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
This work presents a general rank-learning framework for passage ranking within Question Answering (QA) systems using linguistic and semantic features. The framework enables query...
TIT
2010
13 years 29 days ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
PLDI
2003
ACM
13 years 11 months ago
2003
ACM
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
CODES
2006
IEEE
13 years 8 months ago
2006
IEEE
A key step in the design of multi-rate real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure as caused by bounded buff...
GLOBECOM
2008
IEEE
13 years 6 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...