Search Results

Search found 16 results on 1 pages for 'algoman'.

Page 1/1 | 1 

• Disk Search / Sort Algorithm

  - by AlgoMan

  Given a Range of numbers say 1 to 10,000, Input is in random order. Constraint: At any point only 1000 numbers can be loaded to memory. Assumption: Assuming unique numbers. I propose the following efficient , "When-Required-sort Algorithm". We write the numbers into files which are designated to hold particular range of numbers. For example, File1 will have 0 - 999 , File2 will have 1000 - 1999 and so on in random order. If a particular number which is say "2535" is being searched for then we know that the number is in the file3 (Binary search over range to find the file). Then file3 is loaded to memory and sorted using say Quick sort (which is optimized to add insertion sort when the array size is small ) and then we search the number in this sorted array using Binary search. And when search is done we write back the sorted file. So in long run all the numbers will be sorted. Please comment on this proposal.

  Read the article

• Install error on installing Developer 2k 1.2.1on Virtualized Windows NT

  - by AlgoMan

  I am trying to install Developer 2k 1.3.2 on a virtualized windows nt system. I am facing the following access exception. An application error has occurred log has been generated ORAINST.exe Exception: Access violation (0xc0000005) , address:0x00ea78ea Can anyone help me understand what might be going wrong ?

  Read the article

• How to detect Browser type in Django ?

  - by AlgoMan

  How can i detect which browser type the client is using. I have a problem where i have to ask people to use different browser (Firefox) instead of IE. How can i get this information. I know http request has this information (Header). How will i get the navigator.appName from the view.py in the Django framework ?

  Read the article

• Cluster Graph Visualization using python

  - by AlgoMan

  I am assembling different visualization tools that are available in python language. I found the Treemap. (http://pypi.python.org/pypi/treemap/1.05) Can you suggest some other tools that are available. I am exploring different ways of visualization of web data.

  Read the article

• Mining Groups of people from Wikipedia

  - by AlgoMan

  I am trying to get the list of people from the http://en.wikipedia.org/wiki/Category:People_by_occupation . I have to go through all the sections and get people from each section. How should i go about it ? Should i use a crawler and get the pages and search through those using BeautifulSoup ? Or is there any other alternative to get the same from Wikipedia ?

  Read the article

• Bag of words Classification

  - by AlgoMan

  I need find words training words and their classification. Simple classification such as . Sports Entertainment and Politics things like that. Where Can i find the words and their classifications. I know many universities have done Bag of words classifications. Is there any repository of training examples ?

  Read the article

• how is google Calculator implemented ?

  - by AlgoMan

  When you search in Google "100F to C" how does it know to convert from Fahrenheit to Celsius. Similarly, conversion from different currencies and simple calculation. What is the data structure used. Or is it simple pattern matching the strings ?

  Read the article

• RDF/XML format to JSON

  - by AlgoMan

  I am trying to convert the RDF/XML format to JSON format. Is there any python (library) example that i can look into for this to do ?

  Read the article

• Naive Bayesian for Topic detection using "Bag of Words" approach

  - by AlgoMan

  I am trying to implement a naive bayseian approach to find the topic of a given document or stream of words. Is there are Naive Bayesian approach that i might be able to look up for this ? Also, i am trying to improve my dictionary as i go along. Initially, i have a bunch of words that map to a topics (hard-coded). Depending on the occurrence of the words other than the ones that are already mapped. And depending on the occurrences of these words i want to add them to the mappings, hence improving and learning about new words that map to topic. And also changing the probabilities of words. How should i go about doing this ? Is my approach the right one ? Which programming language would be best suited for the implementation ?

  Read the article

• Successive adding of char to get the longest word in the dictionary

  - by AlgoMan

  Given a dictionary of words and an initial character. find the longest possible word in the dictionary by successively adding a character to the word. At any given instance the word should be valid word in the dictionary. ex : a - at - cat - cart - chart ....

  Read the article

• Problem with recognizing "\t" for vim in python output.

  - by AlgoMan

  I have a python code something like this file_out.write(str(i).strip()+"\t"+str(dict1[i]).strip()+"\n") But when i try to recognize this with vim by saying on the file that was written. :%s/\t/|/g But it does not recognize the \t

  Read the article

• Abstract class reference

  - by AlgoMan

  Can i have a class Class Room{ ~Room(); virtual cost() =0; } Class Hotel{ map rooms; /* */ }; will my hotel become abstract ? Can it hold the list of concrete Room objects that are derived from Room ?

  Read the article

• Randomly selecting lines from files

  - by AlgoMan

  I have bunch of files and very file has a header of 5 lines. In the rest of the file, pair of line form an entry. I need to randomly select entry from these files. How can i select random files and random entry(pair of line, excluding header) ?

  Read the article

• Iterating through String word at a time in Python

  - by AlgoMan

  I have a string buffer of a huge text file. I have to search a given words/phrases in the string buffer. Whats the efficient way to do it ? I tried using re module matches. But As i have a huge text corpus that i have to search through. This is taking large amount of time. Given a Dictionary of words and Phrases. I iterate through the each file, read that into string , search all the words and phrases in the dictionary and increment the count in the dictionary if the keys are found. One small optimization that we thought was to sort the dictionary of phrases/words with the max number of words to lowest. And then compare each word start position from the string buffer and compare the list of words. If one phrase is found, we don search for the other phrases (as it matched the longest phrase ,which is what we want) Can some one suggest how to go about word by word in the string buffer. (Iterate string buffer word by word) ? Also, Is there any other optimization that can be done on this ?

  Read the article

• deleting all the file of certain size

  - by AlgoMan

  i have bunch of log files and I have to delete the files of some small sizes, which were erroneous files that got created. ( 63bytes ). I have to copy only those files which have data in it .

  Read the article

• Decorator pattern in C++

  - by AlgoMan

  Can someone give me an example of Decorator pattern in C++ ? I have come across the Java version of it. But C++ i have found it difficult to understand the examples that are given.

  Read the article

1