Sciweavers

7129 search results - page 702 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CANDC
2000
ACM
15 years 7 months ago
Sequence Complexity for Biological Sequence Analysis
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
Lloyd Allison, Linda Stern, Timothy Edgoose, Trevo...
EDUTAINMENT
2010
Springer
15 years 5 months ago
Spectrally-Based Single Image Relighting
Abstract. This paper presents a new spectrally-based single image relighting approach. We first compute the spectral radiance of each stimulus on the monitor when displaying the i...
Xiaoxiong Xing, Weiming Dong, Xiaopeng Zhang, Jean...
FOCM
2010
82views more  FOCM 2010»
15 years 5 months ago
Stability and Instance Optimality for Gaussian Measurements in Compressed Sensing
In compressed sensing we seek to gain information about vector x ∈ RN from d << N nonadaptive linear measurements. Candes, Donoho, Tao et. al. ( see e.g. [2, 4, 8]) propos...
P. Wojtaszczyk
ACL
2010
15 years 5 months ago
Reading between the Lines: Learning to Map High-Level Instructions to Commands
In this paper, we address the task of mapping high-level instructions to sequences of commands in an external environment. Processing these instructions is challenging--they posit...
S. R. K. Branavan, Luke S. Zettlemoyer, Regina Bar...
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 4 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney