Sciweavers

4541 search results - page 26 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
BIBE
2007
IEEE
114views Bioinformatics» more  BIBE 2007»
14 years 2 months ago
A Hierarchical Grow-and-Match Algorithm for Backbone Resonance Assignments Given 3D Structure
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
Fei Xiong, Chris Bailey-Kellogg
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 9 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
DMIN
2007
158views Data Mining» more  DMIN 2007»
13 years 10 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
14 years 22 hour ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...
ADMA
2006
Springer
121views Data Mining» more  ADMA 2006»
14 years 2 months ago
A New Polynomial Time Algorithm for Bayesian Network Structure Learning
We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraintbased algorithm. By taking advantage of variable orderi...
Sanghack Lee, Jihoon Yang, Sungyong Park