1565 search results - page 19 / 313 » An unlikely result |
LATIN
1998
Springer
15 years 4 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
RECOMB
2005
Springer
16 years 2 days ago
2005
Springer
We study properties of multidomain proteins from a graph theoretical perspective. In particular, we demonstrate connections between properties of the domain overlap graph and certa...
VTC
2006
IEEE
15 years 5 months ago
2006
IEEE
— In this paper, we present a novel low complexity algorithm for reducing the peak-to-average power ratio (PAPR) occurring in OFDM-based cognitive radios. Although several PAPR r...
WG
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
SIGIR
2009
ACM
15 years 6 months ago
2009
ACM
We investigate using topic prediction data, as a summary of document content, to compute measures of search result quality. Unlike existing quality measures such as query clarity ...