26 search results - page 3 / 6 » New bounds for restricted isometry constants |
JMLR
2010
13 years 1 months ago
2010
We introduce a new method -- the group Dantzig selector -- for high dimensional sparse regression with group structure, which has a convincing theory about why utilizing the group...
STOC
2012
ACM
11 years 8 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
CIAC
1997
Springer
13 years 10 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
LATA
2009
Springer
14 years 1 months ago
2009
Springer
We consider a restricted variant of the hairpin completion called bounded hairpin completion. The hairpin completion is a formal operation inspired from biochemistry. Applied to a ...
MFCS
1994
Springer
13 years 10 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...