Sciweavers

943 search results - page 35 / 189
» How should data structures and algorithms be taught
Sort
View
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
15 years 3 months ago
Multiple Structural RNA Alignment with Lagrangian Relaxation
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
Markus Bauer, Gunnar W. Klau, Knut Reinert
79
Voted
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
15 years 10 months ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan
KDD
1997
ACM
114views Data Mining» more  KDD 1997»
15 years 1 months ago
Schema Discovery for Semistructured Data
To formulate a meaningful query on semistructured data, such as on the Web, that matches some of the source’s structure, we need first to discover something about how the infor...
Ke Wang, Huiqing Liu
ECAL
1999
Springer
15 years 2 months ago
Modeling Categorization Dynamics through Conversation by Constructive Approach
Categorization dynamics as the clustering of words in word relation is studied by a constructive approach which is suited to inquire evolutionary linguistics with dynamical view on...
Takashi Hashimoto
PRL
2010
188views more  PRL 2010»
14 years 4 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...