Sciweavers

87 search results - page 13 / 18
» Combinatorial Complexity of Convex Sequences
Sort
View
BMCBI
2005
201views more  BMCBI 2005»
13 years 7 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota
ICCV
2003
IEEE
14 years 9 months ago
A Caratheodory-Fejer Approach to Robust Multiframe Tracking
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...
Octavia I. Camps, Hwasup Lim, Cecilia Mazzaro, Mar...
JMLR
2010
147views more  JMLR 2010»
13 years 2 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 2 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
ALMOB
2006
80views more  ALMOB 2006»
13 years 7 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel