Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
xtacy
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
83 ms
·
811.
▲
Why people think computers can't
(web.media.mit.edu)
70 points
by
xtacy
16y ago
|
51 comments
812.
▲
by
xtacy
16y ago
Using dynamic programming, you can solve the TSP problem in O(n^2 2^n) time with O(n 2^n) space, n = #cities.
813.
▲
by
xtacy
16y ago
Did I miss something? How do I start this thing? Couldn't find it on Documentation..
814.
▲
Apollo News for iPad
(hawthornelabs.com)
1 points
by
xtacy
16y ago
|
0 comments
815.
▲
by
xtacy
16y ago
I don't get it; is there a convention for contours? What do the colours stand for? Also, what is the scale of traffic that is represented?
816.
▲
by
xtacy
16y ago
I realized this only after accidentally heating a metal cup.
817.
▲
by
xtacy
16y ago
Hasn't anyone attempted to simplify the UI for the ToS? Is it because a UI can be misinterpreted or anything?
818.
▲
by
xtacy
16y ago
It should be possible for the software to prefix "Ask HN" automatically. (if none exists..) But yeah, it just requires little effort from those posting the story. :)
819.
▲
by
xtacy
16y ago
There are more downsides. Given their example of how new webapps will seamlessly integrate into the browser by having their own toolbars and such (the google maps part), it would be very easy to craft a picture-in-picture phishing attack.
820.
▲
by
xtacy
16y ago
How is the transport layer implemented? Does it use TCP? Or does it build its own reliable transport over UDP? Of another concern is the message delivery latency.
821.
▲
I, Pencil.
(econlib.org)
6 points
by
xtacy
16y ago
|
0 comments
822.
▲
by
xtacy
16y ago
Something related: there's a recent work called "tcpcrypt" that argues for "ubiquitous transport encryption" and scales better than HTTPS too. It's backwards compatible with TCP, does not require application rewrite, works with middle boxe
823.
▲
by
xtacy
16y ago
I am just logically arguing here, not in support for anyone. But hasn't Facebook worked "hard" to setup the infrastructure to "collect" users' data? If you want users' data, go ask the users; not via scraping Facebook.
824.
▲
by
xtacy
16y ago
Any plans of open sourcing this? What other features have you planned for it? Versioning? Like gist.github.com?
825.
▲
Oil spill on Orange Beach, Alabama
(guardian.co.uk)
1 points
by
xtacy
16y ago
|
0 comments
826.
▲
by
xtacy
16y ago
This seems quite similar to the FAWN project at CMU. http://www.cs.cmu.edu/~fawnproj/ The idea is similar: if IO is the bottleneck, instead of scaling up IO, scale down the CPU power.
827.
▲
by
xtacy
16y ago
One way to handle such breakage would be to define an extraction template on the fly, based on some content that doesn't change on the page. If, for e.g., you know that the stock quote for Google has GOOG and some number somewhere inside t
828.
▲
The pleasures of ignorance
(readbookonline.net)
1 points
by
xtacy
16y ago
|
0 comments
829.
▲
by
xtacy
16y ago
Bong!
830.
▲
by
xtacy
16y ago
How many of you actually go to the Google homepage to search? With Chrome/Chromium, just type on the address bar; for Firefox have shortcut prefixes. (like "g hacker news" searches for "hacker news".)
831.
▲
WiFi glitch in WWDC
(cnettv.cnet.com)
2 points
by
xtacy
16y ago
|
1 comments
832.
▲
Being God is a big responsibility
(qntm.org)
75 points
by
xtacy
16y ago
|
35 comments
833.
▲
by
xtacy
16y ago
Lot of attention to details. I liked the part where due attention was given to those without a temperature controlled water bath. Awesome!
834.
▲
by
xtacy
16y ago
How is this different HTTP/1.1's support for pipelining?
835.
▲
by
xtacy
16y ago
You can hear the whirring sound of the Macbook fan :-)
836.
▲
by
xtacy
16y ago
From a video, it seems like the smooth application transitions/animations of the iPad is missing.
837.
▲
by
xtacy
16y ago
Even if servers are I/O bound, this setup is almost like crunching 50 machines into one; applications will have lower latency access to data stored on larger memory.
838.
▲
by
xtacy
16y ago
An interesting application of skip lists: http://www.skorks.com/2010/03/faster-list-intersection-using... But I can't see why the same cannot be done using trees. :-/
839.
▲
by
xtacy
16y ago
I see; what about cases where transactions involve objects at multiple servers? I guess I am confusing server specific locks vs client specific locks.
840.
▲
by
xtacy
16y ago
I don't understand how they could avoid locks. They say that each replica runs independently and hence that avoids locking; what about write updates to the same object from different clients? That would need locking of some form at some lev
More ›