Sciweavers

2994 search results - page 527 / 599
» Time sequences
Sort
View
BMCBI
2006
203views more  BMCBI 2006»
13 years 9 months ago
Independent component analysis reveals new and biologically significant structures in micro array data
Background: An alternative to standard approaches to uncover biologically meaningful structures in micro array data is to treat the data as a blind source separation (BSS) problem...
Attila Frigyesi, Srinivas Veerla, David Lindgren, ...
EJC
2007
13 years 9 months ago
Quickly deciding minor-closed parameters in general graphs
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
Erik D. Demaine, Mohammad Taghi Hajiaghayi
TCS
2008
13 years 8 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
CGF
2005
94views more  CGF 2005»
13 years 8 months ago
Morphology-independent representation of motions for interactive human-like animation
This paper addresses the problem of human motion encoding for real-time animation in interactive environments. Classically, a motion is stored as a sequence of body postures encod...
Richard Kulpa, Franck Multon, Bruno Arnaldi
CCE
2004
13 years 8 months ago
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
Multiproduct pipelines permit to transport large volumes of a wide range of refined petroleum products from major supply sources to distribution centers near market areas. Batches...
Diego C. Cafaro, Jaime Cerdá