31 search results - page 5 / 7 » A faster implementation of the Goemans-Williamson clustering... |
172
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
124
Voted
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
116
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
195
Voted
PROCEDIA
2011
14 years 6 months ago
2011
The assessment of chemical similarity between molecules is a basic operation in chemoinformatics, a computational area concerning with the manipulation of chemical structural info...
123
click to vote
CLUSTER
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...