Sciweavers

4698 search results - page 616 / 940
» Making Functionality More General
Sort
View
SIGSOFT
2007
ACM
16 years 7 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
16 years 7 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
16 years 7 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
VLDB
2007
ACM
104views Database» more  VLDB 2007»
16 years 6 months ago
Extending Dependencies with Conditions
This paper introduces a class of conditional inclusion dependencies (CINDs), which extends traditional inclusion dependencies (INDs) by enforcing bindings of semantically related ...
Loreto Bravo, Wenfei Fan, Shuai Ma
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
16 years 6 months ago
An XML transaction processing benchmark
XML database functionality has been emerging in "XML-only" databases as well as in the major relational database products. Yet, there is no industry standard XML databas...
Matthias Nicola, Irina Kogan, Berni Schiefer