Theory
in [Programming]
|
large datasets for classification and regression Hi there, Can anyone tell me some large databases (more than 1 million records) for (binary) classification or regression? I did found KDD99 with 5 million records, but I need more like this. thanks, Laura ... 14 Apr 2008 03:54
Traversa of heap structured search trees Heap structured search trees is my latest neolgism. A (min) heap is a binary tree such that the children of a node are greater than their parent. A heap structured search tree is a heap such that for each node all of the elements of the left subtree are less than ... 12 Apr 2008 15:05
BPL = L ? Hi, I am stuck with the following problem, can someone help me? Thanks! If there is a pseudo-random generator G: {0,1}^O(log n) -> {0, 1}^O(n^k) (k is a natural number) for log(n) space-bounded probabilistic machines so that G is computable in space linear in the input, then BPL = L. How to prove this? ... 12 Apr 2008 11:06
Help me sort though some complex math On Apr 10, 1:54 pm, Ilmari Karonen <usen...(a)vyznev.invalid> wrote: On 10.04.2008, grocery_stocker <cdal...(a)gmail.com> wrote: The questions stem from the following URL http://64.233.167.104/search?q=cache:R1ERKgiy5L8J:www.phrack.org/issu... [snip] Such an operation on bytes is call... 12 Apr 2008 11:54
How to determine whether an expression equals to zero Hi all. I have the following data type: data Expr = Literal Integer | Add Expr Expr -- x + y | Multipy Expr Expr -- x*y | Power Expr Expr -- x^y It represents an expression, which can consist of signed integer literals (arbitrary size), and operators: addition, multiplication, exponentiation. S... 13 Apr 2008 02:59
String tokenizer place in Chomsky hierarchy? String tokenizer is the simplest parser of all. In java, arguably, it is much more frequently used than regular expressions. Yet I fail to see any parsing theory book ever mentioning it. In my practical experience it is easer write a scanner on string tokenizer foundation rather than to use off the shellf reg exp... 15 Apr 2008 13:57
jobs Hear we are providing the information about online jobs. Thousands of Immediate Work at Home Job Openings Now Available! http://jobnowkirjoli.blogspot.com ... 10 Apr 2008 22:09
Combsort: shrink factor for guaranteed O(n log n) worst case time? I am very interested in the sorting algorithm Combsort. It is basically a modified Bubblesort that exploits the concept of exchanging far elements. Quicksort and Shellsort are based on the same idea. There is a very good descrition of Combsort in the Wikipedia (http:// en.wikipedia.org/wiki/Comb_sort). In short:... 10 Apr 2008 13:43
DPA-128 block ciphering questions I tried posting this question in sci.math, but got no response. Maybe the question wasn't clear enough. The question stem from the following URL http://64.233.167.104/search?q=cache:R1ERKgiy5L8J:www.phrack.org/issu... And I quote "--[ 4 - Veins' DPA-128 description DPA-128 is a 16 rounds block cipher pro... 10 Apr 2008 23:45
Goedell's Incompleteness Reconsidered See the following Web sites:- <http://www.age.ne.jp/x/eurms/Supplement/GDL.html#00> <http://www.age.ne.jp/x/eurms/Title.html> ... 10 Apr 2008 07:46 |