Theory
in [Programming]
|
paritioning an array evenly without moving data Suppose we have an array and that we want to find a partitioning element that divides the elements in the array as evenly as possible, and that we want to do this as efficiently as possible without moving elements. In other words we have an array A[i], i=1,...,n. We want to find the index of a middle element ... 28 Jul 2008 17:12
Is this problem NPC? There is a n vertices directed graph consisting of two types of edge, forward edges and backward edges. A forward edge is a directed edge from vertex i to vertex j such that i<j. A backward edge is a directed edge from vertex i to vertex j such that i>j. Decide whether there exists a simple path (no duplicated ve... 25 Jun 2008 09:50
Can I solve 1-in-3 3-SAT in polynomial time? Well, as it turns out, you were right, I did miss something with the 4) possibility. In case the number of equations is not enough (i.e. there are not enough linearly independent of them), the problem is not solvable in polytime. I put up a complete evaluation of when exactly can 1-in-3 3-SAT be solved in P-time... 24 Jun 2008 09:13
Call For Participation: WORLDCOMP'08 (CS and CE conferences), July 14-17, 2008, Las Vegas Call For Participation WORLDCOMP'08 The 2008 World Congress in Computer Science, Computer Engineering, and Applied Computing Date and Location: July 14-17, 2008, Las Vegas, USA http://www.world-academy-of-science.org/worl... 22 Jun 2008 10:09
What's wrong with this proof that P = NP? Hello, I have noticed that there seem to be an abundance of people who have published false proofs that P equals, or does not equal, NP. I have been working for some time to generate my own proof that P != NP; however, after coming up with my proof, I am realistic enough to realize that it may very well be wron... 30 Jun 2008 16:51
Approximate/Fuzzy Search for strings keys Dear all, I have read the literature on fuzzy/approximate search for strings keys in large databases, but I could not find a clear answer on what is the best that has been achieved thus far in terms of the cost of search (regardless of cost of building any index). I understand this depends on the application/d... 20 Jun 2008 13:16
Messenger Plus! Live Messenger Plus! Live is an add-on for Windows Live Messenger that adds tons of features and extras to the software. Extend the possibilities of Messenger and make your experience a lot more entertaining! For more on this subject check out the cool site www.msgpluslive.net ... 19 Jun 2008 06:30
Friedman's TREE(2)? What is the correct value of Friedman's TREE(2)? Near the end of http://www.cs.nyu.edu/pipermail/fom/2006-March/010260.html it's stated that TR(2) = 2 and near the beginning of http://www.cs.nyu.edu/pipermail/fom/2006-March/010279.html this is repeated in the form TREE(2) = 2. Can someone please confir... 19 Jun 2008 01:20
How to resample continuosly time data to be represented real time ? On 27 Mag, 14:52, Patricia Shanahan <p...(a)acm.org> wrote: pamela fluente wrote: ...> Actually in my case, as you can see from my code I have even been concerned about *preserving* min and max. Infact I cannot remove that information which is crucial to the user (for instance in case o... 19 Jun 2008 01:20 |