Sciweavers

728 search results - page 8 / 146
» Compressing combinatorial objects
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 6 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan
EOR
2006
118views more  EOR 2006»
13 years 6 months ago
Multi-objective tabu search using a multinomial probability mass function
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
Sadan Kulturel-Konak, Alice E. Smith, Bryan A. Nor...
RSA
2008
85views more  RSA 2008»
13 years 6 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham
DCG
2010
121views more  DCG 2010»
13 years 4 months ago
Compression Schemes, Stable Definable Families, and o-Minimal Structures
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
H. R. Johnson, M. C. Laskowski
EMNLP
2011
12 years 6 months ago
Simple Effective Decipherment via Combinatorial Optimization
We present a simple objective function that when optimized yields accurate solutions to both decipherment and cognate pair identification problems. The objective simultaneously s...
Taylor Berg-Kirkpatrick, Dan Klein