Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IANDC
2007
66views more  IANDC 2007»
10 years 11 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh
MST
2006
88views more  MST 2006»
10 years 11 months ago
Morpion Solitaire
We study a popular pencil-and-paper game called morpion solitaire. We present upper and lower bounds for the maximum score attainable for many versions of the game. We also show t...
Erik D. Demaine, Martin L. Demaine, Arthur Langerm...
MP
2006
88views more  MP 2006»
10 years 11 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
EOR
2007
99views more  EOR 2007»
10 years 11 months ago
Computing the asymptotic worst-case of bin packing lower bounds
This paper addresses the issue of computing the asymptotic worst-case of lower bounds for the Bin Packing Problem. We introduce a general result that allows to bound the asymptoti...
Teodor Gabriel Crainic, Guido Perboli, Miriam Pezz...
JSAT
2006
88views more  JSAT 2006»
10 years 11 months ago
On Using Cutting Planes in Pseudo-Boolean Optimization
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
Vasco M. Manquinho, João P. Marques Silva
ECCC
2007
144views more  ECCC 2007»
10 years 11 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
DAM
2007
84views more  DAM 2007»
10 years 11 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
CORR
2007
Springer
141views Education» more  CORR 2007»
10 years 11 months ago
Joint Source-Channel Codes for MIMO Block Fading Channels
—We consider transmission of a continuous amplitude source over an L-block Rayleigh-fading Mt 2 Mr multiple-input multiple-output (MIMO) channel when the channel state informatio...
Deniz Gündüz, Elza Erkip
CORR
2007
Springer
121views Education» more  CORR 2007»
10 years 11 months ago
Lower Bounds on Implementing Robust and Resilient Mediators
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
CORR
2007
Springer
115views Education» more  CORR 2007»
10 years 11 months ago
FPRAS for computing a lower bound for weighted matching polynomial of graphs
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
Shmuel Friedland
books