Search Sciweavers | Sciweavers

32545 search results - page 784 / 6509

» Data Structures and Algorithms

228

click to vote

TAMC
2010
Springer

216views Applied Computing» more TAMC 2010»

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width

15 years 6 months ago

Download www.ii.uib.no

Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...

Pinar Heggernes, Daniel Meister, Udi Rotics

claim paper

Read More »

187

click to vote

KDD
2008
ACM

123views Data Mining» more KDD 2008»

Efficient semi-streaming algorithms for local triangle counting in massive graphs

16 years 8 months ago

Download www.chato.cl

Luca Becchetti, Paolo Boldi, Carlos Castillo, Aris...

claim paper

Read More »

141

click to vote

KDD
2002
ACM

109views Data Mining» more KDD 2002»

MARK: a boosting algorithm for heterogeneous kernel models

16 years 8 months ago

Download www.rpi.edu

Kristin P. Bennett, Michinari Momma, Mark J. Embre...

claim paper

Read More »

123

click to vote

KDD
2001
ACM

145views Data Mining» more KDD 2001»

A learning algorithm for string assembly

16 years 8 months ago

Download www.cs.rpi.edu

Mark K. Goldberg, Darren T. Lim, Malik Magdon-Isma...

claim paper

Read More »

177

click to vote

KDD
2001
ACM

186views Data Mining» more KDD 2001»

Detecting graph-based spatial outliers: algorithms and applications (a summary of results)

16 years 8 months ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers