Sciweavers

404 search results - page 24 / 81
» Structure Discovery from Sequential Data
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 11 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
DIS
1998
Springer
15 years 1 months ago
Development of SDS2: Smart Discovery System for Simultaneous Equation Systems
SDS2 is a system to discover and identify the quantitative model consisting of simultaneous equations re ecting the rst principles underlying the objective process through experi...
Takashi Washio, Hiroshi Motoda
ICDM
2007
IEEE
175views Data Mining» more  ICDM 2007»
15 years 4 months ago
gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han
BMCBI
2004
158views more  BMCBI 2004»
14 years 9 months ago
Improvement of alignment accuracy utilizing sequentially conserved motifs
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...
CIVR
2008
Springer
166views Image Analysis» more  CIVR 2008»
14 years 11 months ago
Non-negative matrix factorisation for object class discovery and image auto-annotation
In information retrieval, sub-space techniques are usually used to reveal the latent semantic structure of a data-set by projecting it to a low dimensional space. Non-negative mat...
Jiayu Tang, Paul H. Lewis