FUN in S&T

Wednesday, February 9, 2011

Paul Harrison

Paul Harrison

Some very good Python packages
one of them is : Robust topological sorting and Tarjan's algorithm in Python


Other Code snippets

A key-value data warehouse
Querying intervals efficiently in SQL + Python revisited
Querying intervals efficiently in SQL + Python
Sketchifier
Robust topological sorting and Tarjan's algorithm in Python
lol.py
Lazy lists in Python
Approximate string matching with regular expressions
Search a large sorted text file in Python
Euclidean Distance Transform in Python
Prototype-based programming in Python
Python VP-tree implementation
Simple fairly robust time and date parsing in Python
Posted by VV at 8:00 PM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: Python

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Welcome! Other Links

http://alg-code.blogspot.com/

Labels

  • Active Learning (2)
  • AI (1)
  • BOOK (1)
  • Bookmark (1)
  • Brain Teasers (1)
  • Conference (2)
  • Data Mining (2)
  • IR (1)
  • Large Scale (1)
  • LibSVM (1)
  • Machine Learning (6)
  • MapReduce (1)
  • Matlab (1)
  • NLP (2)
  • NLPS (1)
  • nltk (5)
  • NPL (1)
  • Python (7)
  • Reinforcement Learning (1)
  • Share (1)
  • Software (1)

Search This Blog

Locations of visitors to this page

Total Pageviews

Subscribe To

Posts
Atom
Posts
Comments
Atom
Comments

Blog Archive

  • ▼  2011 (246)
    • ►  June (7)
    • ►  May (8)
    • ►  April (23)
    • ►  March (35)
    • ▼  February (57)
      • Rashid Bin Muhammad's Home Page
      • ICML 2011 Structured Sparsity: Learning and Infere...
      • collection of Tutorials and videos on Data minin
      • Hype about conditional probability puzzles - Stati...
      • AI on the Web
      • The illustrated guide to a Ph.D.
      • Books and papers every graduate student should read
      • 10 tips on how to give an academic talk
      • Notebooks - Cosma
      • Graph Theory Lessons
      • Machine Learning 大家
      • Key Scientific Challenges Program | Yahoo! Labs
      • Notes on Suffix tree
      • Active Learning Group discussion on AL for NLP
      • LibreOffice 3.3.1
      • Machine Learning Summer School Main/Home Page
      • Python Online Source
      • Homepage for Mining Structured Data
      • Large Data in MATLAB
      • Introduction to Graphical Models for Data Mining
      • Large-scale Data Mining: MapReduce and Beyond
      • Annual Conference of the Classification Society
      • The Association for Computing Machinery - FORA.tv
      • ACL HLT 2011
      • bibliography Reference Manager
      • NetBeans UserDir Setup
      • Michael Elad - Personal Page
      • Portable Application
      • Data Clustering Algorithms
      • IJCAI 2011 Workshop on Agents Learning Interactive...
      • ICANN'11
      • Information Retrieval Over Query Sessions - ECIR 2...
      • Effect of training data size
      • # Find the factorial of a given number n (big) --> n!
      • Python - Building Skills in Python
      • How to do interview
      • Learning to Rank Challenge a Success
      • Brainstorming principles
      • Useful Class/STL in C++
      • Kindle 资源
      • Parameter passing in C++
      • Programming Source From Pro Devi::
      • Stanford CS Ed Library
      • A* Pathfinding for Beginners
      • Paul Harrison
      • kd-tree
      • Finding Maximum Subset Sum
      • Install of Orange (Python) in Ubuntu
      • News=> Graph Partitioning and Graph Clustering
      • fun of "ssh localhost"
      • Free Public Datasets | KDD
      • Data Sets | GroupLens Research
      • Apache Mahout
      • GraphLab: A New Parallel Framework for Machine Lea...
      • Unsupervised Learning Challenge | PASCAL 2
      • 2nd Challenge on Large Scale Hierarchical Text cla...
      • Synthesis Lectures on Information Concepts, Retrie...
    • ►  January (116)
  • ►  2010 (27)
    • ►  December (27)

Popular Posts

  • Data visualization tools for Linux
    Data visualization tools for Linux A quick look at six open source graphics utilities M. Tim Jones ( mtj@mtjones.com ), Senior Pri...
  • Python的可变参数*args与**kwargs
    From:http://hi.baidu.com/zengjianyuan/blog/item/6a1cd400f6a6261c728b65b1.html *args是个tuple,**kwargs是个dict。 [zjy@zjy Code]$ cat aa.py de...
  • Interactive Activation & Competition (Built with Processing)
    Interactive Activation & Competition (Built with Processing)
  • NLTK: e-philology cheat sheet
    From: http://blog.ynada.com/tag/nltk # PREP # load nltk import nltk # download stuff nltk.download() # load submodules. list of submodu...
  • Learning to Rank Challenge a Success
    Last year, oct. --> competition : Learning to Rank Challenge a Success | Yahoo! Labs The goal was for participants to learn a ranking f...
  • libsvm compute distance to hyperplane python
    Some collections that relate to how to compute the distance to hyperplane in LibSVM in Python https://github.com/bwallace/curious_snake ...
  • Git
    Google Tech Talk: Linus Torvalds on git http://www.youtube.com/watch?v=4XpnKHJAok8 The Git Wiki's comparison page http://git.or.cz/gitwi...
  • Teach Yourself Programming in Ten Years
    Teach Yourself Programming in Ten Years Why is everyone in such a rush? Walk into any bookstore, and you'll see how to Teach Yourself...
  • How to do interview
    There are many keys you may want to pay attention to during the interview. Typically, a tech-interview will have 3 parts: -1- First part...
  • Research-related Resources
    What is Research in Computer Science Basic Research Skills in Computer Science Advice on Research and Writing Researchers Bible H...
Awesome Inc. theme. Theme images by konradlew. Powered by Blogger.

Followers