Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2008
Springer
117views Education» more  CORR 2008»
12 years 2 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
DM
2002
93views more  DM 2002»
12 years 3 months ago
A proof of the q, t-Catalan positivity conjecture
We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...
Adriano M. Garsia, James Haglund
JCSS
2007
88views more  JCSS 2007»
12 years 3 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles
IPM
2008
90views more  IPM 2008»
12 years 3 months ago
Local relational string and mutual matching for image retrieval
Exhibiting new features and likely related matching techniques to efficiently retrieve images from databases remains an open problem. This paper is first devoted to such a novel d...
Adel Hafiane, Bertrand Zavidovique
COMBINATORICS
2006
112views more  COMBINATORICS 2006»
12 years 3 months ago
More Forbidden Minors for Wye-Delta-Wye Reducibility
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
Yaming Yu
ECCC
2008
82views more  ECCC 2008»
12 years 3 months ago
On Perfect Completeness for QMA
Whether the class QMA (Quantum Merlin Arthur) is equal to QMA1, or QMA with onesided error, has been an open problem for years. This note helps to explain why the problem is diffi...
Scott Aaronson
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
12 years 3 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira
CORR
2010
Springer
89views Education» more  CORR 2010»
12 years 3 months ago
The capacity region of a class of broadcast channels with a sequence of less noisy receivers
The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k 3. We prove that superposition coding is indeed ...
Chandra Nair, Zizhou Vincent Wang
IJCAI
2003
12 years 5 months ago
Recognizing Plan/Goal Abandonment
The ability to recognize when an agent abandons a plan is an open problem in the plan recognition literature and is a significant problem if these methods are to be applied in rea...
Christopher W. Geib, Robert P. Goldman
COMPGEOM
1995
ACM
12 years 7 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
books