Search Results

Search found 6 results on 1 pages for 'fakrudeen'.

Page 1/1 | 1 

• computing "node closure" of graph with removal

  - by Fakrudeen

  Given a directed graph, the goal is to combine the node with the nodes it is pointing to and come up with minimum number of these [lets give the name] super nodes. The catch is once you combine the nodes you can't use those nodes again. [first node as well as all the combined nodes - that is all the members of one super node] The greedy approach would be to pick the node with maximum out degree and combine that node with nodes it is pointing to and remove all of them. Do this every time with the nodes which are not removed yet from graph. The greedy is O(V), but this won't necessarily output minimum number super nodes. So what is the best algorithm to do this?

  Read the article

• Fermat factorization method limit

  - by Fakrudeen

  I am trying to implement Fermat's factorization [Algorithm C in Art of computer programming Vol. 2]. Unfortunately in my edition [ISBN 81-7758-335-2], this algorithm is printed incorrectly. what should be the condition on factor-inner loop below? I am running the loop till y <= n [passed in as limit]. (if (< limit y) 0 (factor-inner x (+ y 2) (- r y) limit)) Is there anyway to avoid this condition altogether, as it will double the speed of loop? (define (factor n) (let ( ( square-root (inexact->exact (floor (sqrt n))) ) ) (factor-inner (+ (* 2 square-root) 1) 1 (- (* square-root square-root) n) n) ) ) (define (factor-inner x y r limit) (if (= r 0) (/ (- x y) 2) (begin (display x)(display " ")(display y)(display " ")(display r)(newline) ;(sleep-current-thread 1) (if (< r 0) (factor-inner (+ x 2) y (+ r x) limit) (if (< limit y) 0 (factor-inner x (+ y 2) (- r y) limit)) ) ) ) )

  Read the article

• passing a scalar query result to coalesce

  - by Fakrudeen

  How can I pass the result from a scalar [single row, single value] query to coalesce? I am trying to pick the priority as (the biggest priority so far in the table) + 1. [0 if it is the first row.] create trigger priority_SuperRuleSamples before insert on SuperRuleSamples FOR EACH ROW SET NEW.Priority=coalesce(NEW.Priority, coalesce( select Priority from SuperRuleSamples order by Priority desc limit 1, -1 )+1 )

  Read the article

• DB.Null equivalent in JDBC

  - by Fakrudeen

  Is there an equivalent of (ADO.NET) DB.Null in JDBC? Or do I simply pass null in the parameter? Particularly in the context of Mysql?

  Read the article

• Trie vs B+ tree

  - by Fakrudeen

  How does Trie and B+ tree compare for indexing lexicographically sorted strings [on the order some billions]? It should support range queries as well. From perf. as well as implementation complexity point of view.

  Read the article

• Generating list of million random elements

  - by Fakrudeen

  How to efficiently generate a list of million random elements in scheme? The following code hits maximum recursion depth with 0.1 million itself. (unfold (lambda(x)(= x 1000000)) (lambda(x)(random 1000)) (lambda(x)(+ x 1)) 0)

  Read the article

1