Sciweavers

111 search results - page 13 / 23
» The Complexity of Local List Decoding
Sort
View
101
Voted
PERVASIVE
2008
Springer
15 years 10 days ago
Localized power-aware routing in linear wireless sensor networks
Energy-efficency is a key concern when designing protocols for wireless sensor networks (WSN). This is of particular importance in commercial applications where demonstrable retur...
Marco Zimmerling, Waltenegus Dargie, Johnathan M. ...
108
Voted
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
16 years 21 days ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
109
Voted
CEC
2007
IEEE
15 years 4 months ago
Efficient assembling of genome fragments using genetic algorithm enhanced by heuristic search
Abstract-- Shotgun sequencing is the state-of-the-art to decode genome sequence. However this technique needs a lot of fragments. Combining those fragments correctly requires enorm...
Satoko Kikuchi, Goutam Chakraborty
TREC
2007
15 years 1 months ago
Overview of the TREC 2007 Question Answering Track
The TREC 2007 question answering (QA) track contained two tasks: the main task consisting of series of factoid, list, and “Other” questions organized around a set of targets, ...
Hoa Trang Dang, Diane Kelly, Jimmy J. Lin
118
Voted
VTC
2008
IEEE
236views Communications» more  VTC 2008»
15 years 6 months ago
Apriori-LLR-Threshold-Assisted K-Best Sphere Detection for MIMO Channels
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...
Li Wang, Lei Xu, Sheng Chen, Lajos Hanzo