Sciweavers

198 search results - page 8 / 40
» Tensor Rank: Some Lower and Upper Bounds
Sort
View
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 7 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
GC
2007
Springer
14 years 10 months ago
On Small and Large Hyperplanes of DW (5, q )
We determine lower and upper bounds for the size of a hyperplane of the dual polar space DW(5, q). In some cases, we also determine all hyperplanes attaining these bounds.
Bart De Bruyn, Harm Pralle
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 1 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
IPPS
1999
IEEE
15 years 2 months ago
A Parallel Algorithm for Bound-Smoothing
Determining molecular structure from interatomic distances is an important and challenging problem. Given a molecule with n atoms, lower and upper bounds on interatomic distances ...
Kumar Rajan, Narsingh Deo
TIT
2010
103views Education» more  TIT 2010»
14 years 4 months ago
Codes in permutations and error correction for rank modulation
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
Alexander Barg, Arya Mazumdar