Sciweavers

841 search results - page 111 / 169
» Approximability of Minimum AND-Circuits
Sort
View
AAAI
2010
13 years 11 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
APVIS
2008
13 years 11 months ago
Illustrative Streamline Placement and Visualization
by the abstracting, focusing and explanatory qualities of diagram drawing in art, in this paper we propose a novel seeding strategy to generate representative and illustrative str...
Liya Li, Hsien-Hsi Hsieh, Han-Wei Shen
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
13 years 11 months ago
On allocations that maximize fairness
We consider a problem known as the restricted assignment version of the max-min allocation problem with indivisible goods. There are n items of various nonnegative values and m pl...
Uriel Feige
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 11 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
AIPS
2004
13 years 11 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf