Sciweavers

2536 search results - page 42 / 508
» Constructing Optimal Highways
Sort
View
CORR
2006
Springer
81views Education» more  CORR 2006»
13 years 10 months ago
Low density codes achieve the rate-distortion bound
Abstract: We propose a new construction for low-density source codes with multiple parameters that can be tuned to optimize the performance of the code. In addition, we introduce a...
Emin Martinian, Martin J. Wainwright
OL
2008
79views more  OL 2008»
13 years 10 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 8 months ago
Feature Construction for Relational Sequence Learning
Abstract. We tackle the problem of multi-class relational sequence learning using relevant patterns discovered from a set of labelled sequences. To deal with this problem, firstly...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
TON
2010
171views more  TON 2010»
13 years 4 months ago
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
Yan Wu, Zhoujia Mao, Sonia Fahmy, Ness B. Shroff
ICSE
2005
IEEE-ACM
14 years 10 months ago
A framework of greedy methods for constructing interaction test suites
Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one ...
Charles J. Colbourn, Myra B. Cohen, Renée C...