Sciweavers

791 search results - page 96 / 159
» Approximating the Maximum Sharing Problem
Sort
View
ISCI
2008
137views more  ISCI 2008»
13 years 7 months ago
Stochastic dominance-based rough set model for ordinal classification
In order to discover interesting patterns and dependencies in data, an approach based on rough set theory can be used. In particular, Dominance-based Rough Set Approach (DRSA) has...
Wojciech Kotlowski, Krzysztof Dembczynski, Salvato...
TIT
2008
112views more  TIT 2008»
13 years 7 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
13 years 6 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks
—The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is...
Arash Khabbazibasmenj, Sergiy A. Vorobyov
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
14 years 9 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi