| Computing desk | ||
|---|---|---|
| < November 25 | << Oct | November | Dec >> | November 27 > |
| Welcome to the Wikipedia Computing Reference Desk Archives |
|---|
| The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
For a problem I am working on I need to the following: given an m by n array of 1's and 0's, partition the 1's into squares. In other words, I need to group the entries that are 1 into squares. My current method is to start at the upper left corner, find the first 1, then find the biggest square containing it, then find the next 1 not in it, do the same - moving across to the right, then down. This works fairly well for my purposes, but on certain arrays I'm getting a large number of squares that are 1x1, I would prefer a method that can find a more optimal partition (my arrays are not very "jagged", the boundaries between 1's and 0's are almost always vertical or horizontal segments, so I feel that a better solution should be possible). Thank you for any help.24.3.9.16 (talk) 07:01, 26 November 2016 (UTC)
Is it possible to change a simple D.C. circuit (say 12 volts), to an A.C. circuit (frequency whatever) using this thing shown in the picture along ?

210.56.127.82 (talk) 18:03, 26 November 2016 (UTC)
Flud, available as an app for Android systems, is today most fast, easy to use and reliable Torrent agent. Is there any such application in Windows (using 7) that is worthy of such commendation ? 210.56.127.82 (talk) 18:30, 26 November 2016 (UTC)