Search Results

Search found 5655 results on 227 pages for 'stl algorithm'.

Page 164/227 | < Previous Page | 160 161 162 163 164 165 166 167 168 169 170 171  | Next Page >

• C# A random BigInt generator

  - by Tony

  Hi, I'm about to implement the DSA algorithm, but there is a problem: choose "p", a prime number with L bits, where 512 <= L <= 1024 and L is a multiple of 64 How to implement a random generator of that number? Int64 has "only" 63 bits length

  Read the article

• Forcing deallocation of large cache object in Java

  - by Jack

  I use a large (millions) entries hashmap to cache values needed by an algorithm, the key is a combination of two objects as a long. Since it grows continuously (because keys in the map changes, so old ones are not needed anymore) it would be nice to be able to force wiping all the data contained in it and start again during the execution, is there a way to do effectively in Java? I mean release the associated memory (about 1-1.5gb of hashmap) and restart from the empty hashmap..

  Read the article

• How to generate irregular ball shapes?

  - by tomato

  What kind of algorithms would generate random "goo balls" like those in World of Goo. (btw, if you haven't played it yet, highly recommended). I'm using Proccesing, but any generic algorithm would do. I guess it boils down to how to "randomly" make balls that are kind of round, but not perfectly round, and still looking realistic. Thanks in advance!

  Read the article

• Interview question

  - by rahul

  Recenty I was asked this interview question: There is a server which receives millions of requests every day. Design an API for finding out hits in the last one minute, in the last 10 minutes etc. What should be the algorithm and design to implement it efficienly. I want to know the ideas on this.

  Read the article

• Counting through all binary numbers with equal 1's and 0's

  - by Stuart

  I'm implementing a binary representation of an equal-side bi-partitioning algorithm and I'm wondering what the best way to iterate through all combinations of N bits that have equal (N/2) 1's and 0's. I'm trying to find the quickest way, not the easiest to code. Thanks.

  Read the article

• How does Microsoft generate the Event ID for winqual events?

  - by Tim

  I am curious about the IDs that are used to identify items in winqual. I assume it is some sort of hash. Is this published? Hash of the module name, its version and an offset? That seems appropriate but the size is too small to cover the possibilities unless some truncation/lossy algorithm is used. This seems to be generated with the minidump on the client machine.

  Read the article

• How do I implement graphs and graph algorithms in a functional programming language?

  - by brad

  Basically, I know how to create graph data structures and use Dijkstra's algorithm in programming languages where side effects are allowed. Typically, graph algorithms use a structure to mark certain nodes as 'visited', but this has side effects, which I'm trying to avoid. I can think of one way to implement this in a functional language, but it basically requires passing around large amounts of state to different functions, and I'm wondering if there is a more space-efficient solution.

  Read the article

• SOM for Detection

  - by Tim

  I would like to know how I can use SOM for disease detection. Given a lung cancer dataset, how can SOM be applied for detection, there are certain terminologies like, sensitivity, specificity and accuracy percentages....are there ways to calculate all these with the SOM algorithm? I would appreciate answers from anyone who can shed more light on this

  Read the article

• Creating a MySQL view with an auto-incrementing id column

  - by hmemcpy

  I have a MySQL database from which a view is created. Is is possible to add an auto-incrementing id for each row in the view? I tried CREATE ALGORITHM=UNDEFINED DEFINER=`database_name`@`%` SQL SECURITY DEFINER VIEW `MyView` AS set @i = 0; select @i:=@i+1 as `id` ... but that doesn't work in a View. Sorry, my SQL is weak, any help is appreciated.

  Read the article

• python: a way to get an exhaustive, sorted list of keys in a nested dictionary?

  - by saidimu

  exhaustive: - all keys in the dictionary, even if the keys are in a nested dictionary that is a value to a previous-level dictionary key. sorted: - this is to ensure the keys are always returned in the same order The nesting is arbitrarily deep. A non-recursive algorithm is preferred. level1 = { 'a' : 'aaaa', 'level2_1' : {'b': 'bbbbb', 'level3': {'c': 'cccc', 'd': 'dddddd'} }, 'level2_2' : { 'z': 'zzzzzzz' } }

  Read the article

• Java fixed memory map

  - by juber

  Hi, Is there a simple, efficient Map implementation that allows a limit on the memory to be used by the map. My use case is that I want to allocate dynamically most of the memory available at the time of its creation but I don't want OutOFMemoryError at any time in future. Basically, I want to use this map as a cache, but but I wanna avoid heavy cache implementations like EHCache. My need is simple (at most an LRU algorithm)

  Read the article

• Google image Swirl - interactive information visualization

  - by skyde

  I have seen this image swirl effect on a visual thesaurus. Is there any open source code for this? Or research paper explaining how they made it. I don't care about the algorithm to match similar objects. I only am wondering about the effects. From what i understand they are called recursive orbital diagram. Screenshot: google Wonder Wheel google image swirl

  Read the article

• Best way to get individual digits from int for radix sort in C/C++

  - by jordanstephens

  What is the best way to get individual digits from an int with n number of digits for use in a radix sort algorithm? I'm wondering if there is a particularly good way to do it in C/C++, if not what is the general best solution?

  Read the article

• LZMA compression settings details

  - by Shadi

  Hi everyone, I really need to know what each lzma parameter (mf, fb, lp, ...) means. I could not find any good documentation in the internet. I need details of this algorithm. the most detailed one is: http://www.bugaco.com/7zip/MANUAL/switches/method.htm I would appreciate any help. Best wishes, Shadi.

  Read the article

• Interview Q: find angle between hour and minute hands in an analog clock

  - by polygenelubricants

  I was given this interview question recently: An analog clock shows that the current time is HH:MM. Compute in degree, the smaller angle between the hour and minute hands. Be as precise as you can. I'm wondering what's the simplest, most readable, most precise algorithm is. Solution in any language is welcome (but do explain it a bit if you think it's necessary).

  Read the article

• 50 sequences in one line

  - by user343934

  I have alignment file and long record in it. Suppose while displaying to an end user i want to show Sequence ID and 50 sequences in each line and continue further till the end of file. Can anyone suggest me algorithm or example code in python. Thanks in advance

  Read the article

• Questions about .NET CollectionEditor type

  - by smwikipedia

  Who can tell me the internal working mechanism of a CollectionEditor in plain English? I have implemented every virtual function and step into each of them. Still got no clue of its intended algorithm. I searched the web and found tons of compaints about the CollectionEditor type, and even bugs. I am kind of thinking of the CollectionEditor as a total mess.

  Read the article

• Using TSQL to Unzip a value

  - by Anthony Faull

  How can I unzip a varbinary(max) value in a stored procedure? I'd like to implement or invoke a gunzip algorithm within TSQL code, preferably without enabling the CLR.

  Read the article

• Is there a python wrapper for a FastLZ implementation

  - by Rhubarb

  Looking to use FastLZ in Python, or something similar. Tried Google and didn't find anything. Wondering if there is another algorithm with similar performance available in Python?

  Read the article

• Exception in thread "main" java.lang.OutOfMemoryError, How to find and fix??

  - by or.nomore

  hey, I'm trying to programming a crossword creator. using a given dictionary txt file and a given pattern txt file. The basic idea is using DFS algorithm. the problem begin when the dictionary file is v-e-r-y big (about 50000 words). then i recive the : Exception in thread "main" java.lang.OutOfMemoryError: GC overhead limit exceeded i know that there is a part in my program that waists memory, but i don't know where it is, how to find it and how to fix it

  Read the article

• about the usage of mudolus operator

  - by matin1234

  Hi this a part of code for Quick Sort algorithm but realy I do not know that why it uses rand() %n please help me thanks Swap(V,0,rand() %n) // move pivot elem to V[0]

  Read the article

• String Processing Algorithms..

  - by RBA

  Hi, Please share some good websites where I can learn more on String Processing Techniques and could grill myself more into different kinds of algorithm available in this field.. Thanks..

  Read the article

• Rectangles Covering

  - by den bardadym

  I have N rectangles with sides parallel Ox and Oy. Exists another rectangele (model). I need create algorithm, which can tell: is model covered by N rectangles? and code him. I have some ideas. First I think need sort rectangles by left side (it can be done by O(n log n)). Then I think need use vertical sweeping line. Thanks.

  Read the article

• Too much data for RSA block fail. What is PKCS#7?

  - by Tom Brito

  Talking about javax.crypto.Cipher; I was trying to encrypt data using Cipher.getInstance("RSA/None/NoPadding", "BC"); but I got the exception: ArrayIndexOutOfBoundsException: too much data for RSA block Looks like is something related to the "NoPadding", so, reading about padding, looks like CBC is the best approach to use here. I found at google something about "RSA/CBC/PKCS#7", what is this "PKCS#7"? And why its not listed on sun's standard algorithm names?

  Read the article

• SHA2 Certificates in Windows 2003 CA

  - by rursw1

  Hi all, Is it possible to create a certificate template that uses SHA-2 (sha256, sha224, sha384, sha512), from a Windows server 2003 CA? I know how to do it in Windows server 2008 based CA, with the new version (version 3) - it is possible to specify the hash algorithm (Under the "Cryptography" tab of the template properties). But is it possible in 2003 based CA? Thanks.

  Read the article

< Previous Page | 160 161 162 163 164 165 166 167 168 169 170 171  | Next Page >