Sciweavers

626 search results - page 110 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
AAAI
2010
13 years 8 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 8 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 7 months 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»
13 years 7 months 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
JCO
2006
234views more  JCO 2006»
13 years 7 months 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