Sciweavers

1525 search results - page 138 / 305
» Matching with Regular Constraints
Sort
View
IFIP
2004
Springer
15 years 9 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
NIPS
2007
15 years 5 months ago
Object Recognition by Scene Alignment
Current object recognition systems can only recognize a limited number of object categories; scaling up to many categories is the next challenge. We seek to build a system to reco...
Bryan C. Russell, Antonio Torralba, Ce Liu, Robert...
CORR
2010
Springer
172views Education» more  CORR 2010»
15 years 4 months ago
Seeing Through Black Boxes : Tracking Transactions through Queues under Monitoring Resource Constraints
The problem of optimal allocation of monitoring resources for tracking transactions progressing through a distributed system, modeled as a queueing network, is considered. Two for...
Animashree Anandkumar, Ting He, Chatschik Bisdikia...
143
Voted
BMCBI
2006
85views more  BMCBI 2006»
15 years 4 months ago
Use of physiological constraints to identify quantitative design principles for gene expression in yeast adaptation to heat shoc
Background: Understanding the relationship between gene expression changes, enzyme activity shifts, and the corresponding physiological adaptive response of organisms to environme...
Ester Vilaprinyó, Rui Alves, Albert Sorriba...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 10 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...