Sciweavers

314 search results - page 61 / 63
» Computing all Suboptimal Alignments in Linear Space
Sort
View
SDM
2012
SIAM
247views Data Mining» more  SDM 2012»
11 years 9 months ago
Simplex Distributions for Embedding Data Matrices over Time
Early stress recognition is of great relevance in precision plant protection. Pre-symptomatic water stress detection is of particular interest, ultimately helping to meet the chal...
Kristian Kersting, Mirwaes Wahabzada, Christoph R&...
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 7 months ago
Discovering significant OPSM subspace clusters in massive gene expression data
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
Byron J. Gao, Obi L. Griffith, Martin Ester, Steve...
PODC
2005
ACM
14 years 1 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 8 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CIVR
2008
Springer
271views Image Analysis» more  CIVR 2008»
13 years 9 months ago
Multiple feature fusion by subspace learning
Since the emergence of extensive multimedia data, feature fusion has been more and more important for image and video retrieval, indexing and annotation. Existing feature fusion t...
Yun Fu, Liangliang Cao, Guodong Guo, Thomas S. Hua...