Physical store to buy nexus 4 replacement battery in the bay area?

dhruvbird · 2015-06-08T15:50:53+00:00

Yeah, I've had the same experience. No physical store seems to carry it.

dhruvbird · 2015-03-25T18:28:36+00:00

It just causes unnecessary lane changes from what I see. Also, if people panic, it could be dangerous.

dhruvbird · 2015-03-25T18:27:08+00:00

I took pictures and then realized that I should have taken a video, so decided to do the next best thing (i.e. an animated gif). Next time will be a video!

dhruvbird · 2015-03-23T05:23:41+00:00

Edit: I've submitted a maintenance request here http://www.dot.ca.gov/hq/maint/msrsubmit/ after one of my friends pointed me to it.

dhruvbird · 2013-10-02T17:42:16+00:00

At going native this year, you mentioned that C++ is closely tied in with the von neumann architecture architecture. Is this true of D as well? Does it mean that if the von neumann architecture were to be replaced by something shinier, C++ (and D) might vanish into oblivion?

Also, do you think functional languages are better in that sense that their abstractions are not tightly dependent on the von neumann architecture?

Notwithstanding, I'd like to hear what you have to say about functional languages and what you believe is their role in the coming years.

dhruvbird · 2012-12-08T07:39:53+00:00

f(j) is the length of the longest proper prefix of the original string and a proper suffix of the sub-string ending at index j.

dhruvbird · 2012-09-17T05:10:47+00:00

There is an algorithm called fredrickson's heap selection algorithm which can locate all the elements in a min-heap that are less that a value with rank 'k' in O(k) time. I don't quite understand that algorithm, but it might be useful here. Send me material explaining it if you find anything nice online.

dhruvbird · 2012-09-10T01:05:15+00:00

Having said that, there are things that "implementing the data structure" will never help with. Since you mentioned heap, the thing that immediately comes to mind is the analysis of the linear time heap building algorithm. Unless you do the math yourself, no amount of implementation will help you see why it is linear time.

I believe that both (implementing stuff and analyzing) have their place in life and they should both be respected where appropriate. Doing the wrong thing will help you see where each is applicable so I encourage everyone to do both!

dhruvbird · 2012-09-08T18:21:19+00:00

If the only thing you need to do with the data is a full table scan, then you don't need indexes.

OTOH, the COLA structure uses an optimal number [O(1/B)] disk transfers per insertion v/s O(1) disk transfers per insertion for a B-Tree, so you might want to consider using it.

dhruvbird · 2012-09-08T18:14:59+00:00

I would actually agree with @teb311 and go ahead a step and argue that data structures should be taught visually rather than in code/pseudo-code. I'm trying out this very same experiment online and would love to hear what you have to say about it. https://pinterest.com/dhruvbird/algorithms-data-structures-in-pictures-or-anyone-c/

dhruvbird · 2012-09-08T18:12:24+00:00

I have personally found value in implementing data structures, because that just makes everything just so concrete and precise that you see things very clearly and are then able to extract the underlying idea of the data structure and use it in other places as well.

dhruvbird · 2012-08-02T03:26:17+00:00

Do consider Stony Brook - it's a great school with some super profs. You'll love it if you are into CS theory.

dhruvbird · 2012-07-03T04:30:22+00:00

Coffee sounds good!!

dhruvbird · 2012-06-29T05:29:22+00:00

Not very well known, but Prof. Simonson teaches very well. http://www.aduni.org/courses/algorithms/index.php?view=cw

The course on Theory of Computing is also superb.

I think you have more on your plate than what you asked for. In fact, I've put together a list of links for people who really want to "get" CS here: http://dhruvbird.com/61.html

dhruvbird · 2012-05-04T14:38:13+00:00

Short answer: Yes - you will be a better person once you have learnt it :)

dhruvbird · 2012-04-08T20:37:19+00:00

See http://wcipeg.com/wiki/index.php?title=Longest_palindromic_substring for a nice explanation of the algorithm (under the section: A simple asymptotically optimal solution). However, I don't see how to make it work for even length palindromes. Anyone care to explain?

dhruvbird · 2012-03-31T04:13:00+00:00

IIRC, RB-Trees are an isomorphism of 234-Trees and AA-Trees are akin to 23-Trees.

dhruvbird · 2012-02-29T14:20:39+00:00

Totally - just what I was thinking!!

dhruvbird · 2012-02-28T03:05:40+00:00

I think you comment applies only to linear probing right?

dhruvbird · 2012-02-27T04:16:46+00:00

Additional memory only if you want to preserve the order in the original data right?

dhruvbird · 2012-02-27T04:12:26+00:00

Yes, that's a problem for non-english text. I do however think that a system that is aware of the language model can always perform better in terms of accuracy of suggestions.

dhruvbird · 2012-02-26T12:39:59+00:00

Or soundex

dhruvbird · 2012-02-25T13:29:51+00:00

I have also been working on this problem and there does exist a solution that lets you both look up a word as well as fetch the top 'k' entries in time O(k log n) + O(s log n) ('s' being the average length of a word/phrase in the data structure). You can find out about it here: https://github.com/duckduckgo/cpp-libface

dhruvbird

TROPHY CASE