Sciweavers

841 search results - page 113 / 169
» Approximability of Minimum AND-Circuits
Sort
View
112
Voted
CORR
2010
Springer
97views Education» more  CORR 2010»
15 years 15 days ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
CN
2006
75views more  CN 2006»
15 years 13 days ago
Dynamic online QoS routing schemes: Performance and bounds
Several dynamic QoS routing techniques have been recently proposed for new IP networks based on label forwarding. However, no extensive performance evaluation and comparison is av...
Antonio Capone, Luigi Fratta, Fabio Martignon
121
Voted
DSP
2006
15 years 13 days ago
Blind image deconvolution via dispersion minimization
In linear image restoration, the point spread function of the degrading system is assumed known even though this information is usually not available in real applications. As a re...
C. Vural, William A. Sethares
JCO
2006
234views more  JCO 2006»
15 years 11 days ago
Coverage by directional sensors in randomly deployed wireless sensor networks
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
Jing Ai, Alhussein A. Abouzeid
101
Voted
JCO
2006
150views more  JCO 2006»
15 years 11 days ago
Efficient algorithms for shared backup allocation in networks with partial information
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
Yigal Bejerano, Joseph Naor, Alexander Sprintson