Sciweavers

3136 search results - page 257 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
APLAS
2010
ACM
15 years 5 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
PPOPP
2012
ACM
14 years 2 months ago
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
James A. Edwards, Uzi Vishkin
KDD
2012
ACM
197views Data Mining» more  KDD 2012»
13 years 9 months ago
On the separability of structural classes of communities
Three major factors govern the intricacies of community extraction in networks: (1) the application domain includes a wide variety of networks of fundamentally different natures,...
Bruno D. Abrahao, Sucheta Soundarajan, John E. Hop...
SIGPRO
2008
151views more  SIGPRO 2008»
15 years 6 months ago
An adaptive penalized maximum likelihood algorithm
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...
Guang Deng, Wai-Yin Ng
NIPS
2004
15 years 8 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...