Algorithms

Results: 10964



#Item
951Introduction  Memoryless Computation Universal Simulation

Introduction Memoryless Computation Universal Simulation

Add to Reading List

Source URL: www.maths.dur.ac.uk

Language: English - Date: 2015-09-03 03:05:49
952Chapter 1  Links Reconstruction Attack Using Link Prediction Algorithms to Compromise Social Networks Privacy Michael Fire, Gilad Katz, Lior Rokach, and Yuval Elovici1

Chapter 1 Links Reconstruction Attack Using Link Prediction Algorithms to Compromise Social Networks Privacy Michael Fire, Gilad Katz, Lior Rokach, and Yuval Elovici1

Add to Reading List

Source URL: proj.ise.bgu.ac.il

Language: English - Date: 2012-05-05 05:45:54
953Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2012-04-20 08:45:09
954I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge

I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge

Add to Reading List

Source URL: users.cs.duke.edu

Language: English - Date: 2015-07-24 06:57:53
955SS_Bent_Cones_Klehm11.pdf

SS_Bent_Cones_Klehm11.pdf

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2012-01-03 04:29:36
956LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:54
957CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-29 00:22:18
958DIMACS Series in Discrete Mathematics and Theoretical Computer Science Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry Thorsten Theobald

DIMACS Series in Discrete Mathematics and Theoretical Computer Science Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry Thorsten Theobald

Add to Reading List

Source URL: www.math.uni-frankfurt.de

Language: English - Date: 2006-12-30 13:09:42
959Classical and Quantum Algorithms for Finding Cycles Jill Cirasella Computational Sciences Specialist Brooklyn College Library

Classical and Quantum Algorithms for Finding Cycles Jill Cirasella Computational Sciences Specialist Brooklyn College Library

Add to Reading List

Source URL: jillcirasella.commons.gc.cuny.edu

Language: English - Date: 2014-05-02 15:14:51
960Finding Highly Correlated Pairs Efficiently with Powerful Pruning ∗ Joan Feigenbaum

Finding Highly Correlated Pairs Efficiently with Powerful Pruning ∗ Joan Feigenbaum

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2006-08-31 13:51:39