Discussions - comp.theory

	The future of programming embodied by childlike imagination coupled with adult discipline
	\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ \\\\\\\\\\\\\\\\\\\\\\ In support of a cure for childhood cancer: [link] ...[link] - <mode>+</code> = your imagination ... <mode>// (C) 2009. Mode/Code (TM) Language is a trademark of M.</ code> <mode>Michael</code>// <mode>//Musatov and MeAmI ([link])</code>... more » By debaser - 3:09am - 1 new of 1 message

	Math/CompSci Interview Question - Thoughts?
	I was posed the following question in a technical interview for a Software Engineering position by a major multinational NASDAQ company: [Paraphrasing] "You are given an array of 1,000,000 32-bit integers. One int value x occurs 500,001 times or more in the array. Specify an algorithm to determine x."... more » By Andrew Tomazos - Nov 21 - 18 new of 18 messages

	www.brandshoes08.com Paypal wholesale brand SHOES,clothes,handbag,WATCH,ey eglass,cap,shawl,wallt and so on.
	Discount wholesale Ebel Watch ([link]) (paypal payment) Discount wholesale Bape Watch Discount wholesale Bell&Ross Watch Discount wholesale Breit Ling Watch ([link]) (paypal payment) Discount wholesale Burberry Watch Discount wholesale Cartier Watch Discount wholesale Chopard Watch... more » By wholesale shoes clothes watch by paypal - Nov 20 - 1 new of 1 message

	Unhashing int64 to string
	A classic string hashing algorithm can be simply described by the following code (C++ like pseudo code) int64 hash(string s) { int64 hash = 5381; for (i = 0; i < s.length; i++) hash = (hash * 33) XOR s[i]; return hash; ...Is there any known approach to "unhash" a string (consisting no more... more » By Isliguezze - Nov 19 - 2 new of 2 messages

	Interesting tech competition
	Saw that in Techcrunch, this competition should interest the group: [link]. The company is looking for best ideas for games, laptops, phones, music using this new tech: the 5 winnings ideas get $6,000, and more. Ideas can be submitted by Nov 30, competition ends Dec 13th: the more... more » By Dorr - Nov 17 - 1 new of 1 message

Coins on chess-board puzzle

Hi, I recently heard about a very nice puzzle with a computer science / TCS flavor. The person who told me it had found a solution, but the person who told them didn't even know if there was a solution. Here is the puzzle: ---- A room contains a normal 8×8 chess board together with 64 identical coins, each with one “heads” side and one “tails” side. Two prisoners... more »

By Nicholas Nash - Nov 17 - 22 new of 22 messages

	Fractional Knapsack Problem
	Hello, I would greatly appreciate it if some one could shed some light on this problem. The 0/1 Knapsack problem has been proven to be NP complete for a single knapsack as well as the multiple knapsack cases. The fractional knapsack (single knapsack case) exhibits greedy optimal solution. My questions is as follows:... more » By arush - Nov 16 - 2 new of 2 messages

	TMFCS-10 Call for papers
	TMFCS-10 Call for papers The 2010 International Conference on Theoretical and Mathematical Foundations of Computer Science (TMFCS-10) (website: [link]) will be held during 12-14 of July 2010 in Orlando, FL, USA. TMFCS is an important event in the theoretical, mathematical and logical areas... more » By James Heralds - Nov 15 - 1 new of 1 message

	Smallest circle covering set of points
	Given a set of points (a1,b1) (a2,b2)..(an,bn) in the plane - what's a good algorithm for determining the centerpoint and radius of the smallest circle that will cover all the points? Thanks, Andrew. By Andrew Tomazos - Nov 14 - 24 new of 24 messages

	Cheats
	JUST WANT TO INFORM EVERYONE THAT COMPANY EXPLORER TOURS ARE FRAUDS. By Ms Khan - Nov 13 - 1 new of 1 message