xtacy

61 ms·

601.
by xtacy 16y ago
Brilliant! "Just 250 lines of Qt and C++" shows how good Qt/WebKit are.
602.
Thinking beyond the compiler: libclang (Slides)(llvm.org)
1 points by xtacy 16y ago|0 comments
603.
by xtacy 16y ago
Emacs would be awesome too. :-)
604.
by xtacy 16y ago
What does "After porting your number to Google Voice your mobile service plan will be cancelled.." mean? I am on AT&T; does this mean I am no more a part of AT&T?
605.
LinkedInLabs: visualise your network(inmaps.linkedinlabs.com)
10 points by xtacy 16y ago|1 comments
606.
by xtacy 16y ago
Mathematica has a nice syntax for function application, mapping over lists, etc. It's also possible to define such operators in Haskell, which has the added advantage of type-safety. f @ {1,2,3} == f[{1,2,3}] f /@ list == map(f, list
607.
by xtacy 16y ago
Fantastic! It would be interesting to combine pipelines into something that branches off into various categories. For e.g., you could split the lines of access-log file into IP addresses and size of requests and fork off separate processin
608.
by xtacy 16y ago
You mention two problems: * Finding good papers * Obtaining a copy of those good papers. For finding good papers, use Citeseerx or Google scholar or Microsoft Academic Search. One popular metric is to look at the # citations :)
609.
by xtacy 16y ago
The fundamental mechanism: Setting a breakpoint at a particular instruction requires overwriting the instruction at the address to "int 0x3" (which is exactly 1 byte long). Something nice to think about: why should the breakpoint interrupt
610.
ITerm 2(sites.google.com)
185 points by xtacy 16y ago|80 comments
611.
by xtacy 16y ago
This is what scares me about Microsoft Research. Since Google's research adds direct value to what it's doing, it is quite unlikely to disintegrate.
612.
SilentBob: An alternative to ctags/cscope/ctree.(silentbob.sourceforge.net)
2 points by xtacy 16y ago|0 comments
613.
by xtacy 16y ago
It would be much difficult to write many more complex scrapers just using regexes, which is why methods like the one posted above scale well with complexity. For example, if you wanted to scrape comments on HN and get a tree-like data struc
614.
Regex generator: Give sample text, look for known patterns, gives a regex(txt2re.com)
116 points by xtacy 16y ago|12 comments
615.
by xtacy 16y ago
I saw these long back in a forum that listed such expressions for all printable characters; I am unable to locate them now. Can someone help? Thanks!
616.
Entanglement Game (HTML5)(entanglement.gopherwoodstudios.com)
1 points by xtacy 16y ago|0 comments
617.
Infographic: Looking back at Wikipedia's evolution(flowingdata.com)
1 points by xtacy 16y ago|0 comments
618.
Woopra: Real time web analytics(woopra.com)
13 points by xtacy 16y ago|17 comments
619.
by xtacy 16y ago
Related: Arithmetic coding, which achieves compression rates much closer to the theoretical limit. http://en.wikipedia.org/wiki/Arithmetic_coding EDIT: Note that in all cases, we assume that the symbol occurrences are independent. LZW ou
620.
by xtacy 16y ago
I would like to clarify that just because an algorithm runs slower than the ones used by solvers in competitions like SAT, it doesn't mean much, as we're looking at asymptotic complexity here. To give an example: the "PRIMES is in P" paper
621.
by xtacy 16y ago
This is confusing: OPEN INTERNET RESEARCH CHALLENGE ... Both published and unpublished papers will be accepted. Published research papers need to have been published after January 2007. Both published and unpublished papers
622.
by xtacy 16y ago
Is there any reason why 10 PB was split in that particular combination of 2, 1.5 and 1TB drives? EDIT: And, just a comparison: Google processes over 20PB of data per day!
623.
by xtacy 16y ago
The consecutive row optimisation is an interesting one and in practice, it has a large impact on the runtime, even though the theoretical time complexity does not change. Having a smaller table => it can fit in the cache => better t
624.
by xtacy 16y ago
With so many students, there is also a lack of inspiring and well qualified professors to take up the job of teaching them.
625.
Attacking High Frequency Trading networks(schneier.com)
5 points by xtacy 16y ago|0 comments
626.
by xtacy 16y ago
How many employees does Facebook have? If they have around 5000 employees, then on an average, if they go public for the valuation claimed, every employee gets around $3M!
627.
by xtacy 16y ago
I really don't understand: how is this article different from the story posted on http://news.ycombinator.com/item?id=2089570 ? (Apart from being slides vs no-slides)
628.
by xtacy 16y ago
Related project: RAMCloud at Stanford. http://fiz.stanford.edu:8081/display/ramcloud/Home It's a _pure_ in memory key-value store, that aims to give the lowest latency access to data as possible (~1 to 10us for small bytes of data).
629.
by xtacy 16y ago
To avoid cryptic looking escape sequences, one could have the colour codes named in their .?shrc file [1]: txtblk='\e[0;30m' # Black - Regular txtred='\e[0;31m' # Red txtgrn='\e[0;32m' # Green txtylw='\e[0;33m' # Yellow txtblu='
630.
by xtacy 16y ago
Instead of Stochastic Fairness Queuing, a better approach the bufferbloat problem from the end host is to enable RED/ECN on all client hosts. However, as the author mentions, this is going to massively hurt the non-ECN capable hosts in the

More ›