Sciweavers

342 search results - page 56 / 69
» Constrained Integer Partitions
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
Quasi-randomness of graph balanced cut properties
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
Hao Huang, Choongbum Lee
EOR
2006
74views more  EOR 2006»
13 years 7 months ago
A mixed-integer programming approach to multi-class data classification problem
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...
Fadime Üney Yüksektepe, Metin Türka...
MST
2006
99views more  MST 2006»
13 years 7 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
SIAMDM
2010
84views more  SIAMDM 2010»
13 years 5 months ago
Complementary Iterated Floor Words and the Flora Game
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
Aviezri S. Fraenkel
EMNLP
2010
13 years 5 months ago
Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval
We present three novel methods of compactly storing very large n-gram language models. These methods use substantially less space than all known approaches and allow n-gram probab...
David Guthrie, Mark Hepple