Sciweavers

3136 search results - page 340 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
SIGSOFT
2007
ACM
16 years 7 months ago
Improving test case generation for web applications using automated interface discovery
With the growing complexity of web applications, identifying web interfaces that can be used for testing such applications has become increasingly challenging. Many techniques tha...
William G. J. Halfond, Alessandro Orso
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
16 years 7 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
16 years 7 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
SIGMOD
2005
ACM
105views Database» more  SIGMOD 2005»
16 years 6 months ago
Reference Reconciliation in Complex Information Spaces
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...
Xin Dong, Alon Y. Halevy, Jayant Madhavan