Problem Detail: Given two binary search trees T1 and T2, if it is possible to obtain T2 from T1 using only right-rotation, we say that T1 can be right-converted to T2. For example, given three binary search tree T1, T2 and Read More …
Author: ignougroup
[Solved]: Why are the two farthest points vertices of the Convex Hull?
Problem Detail: I read that in a 2D space, the two points farthest away must be in the convex hull (CH). Intuitively, I can see why. If the two farthest points are not in the convex hull, then there must be Read More …
[Solved]: Data structures as algorithms themselves
Problem Detail: Can data structures be thought of as algorithms themselves? For example, I could implement a stack data structure that has certain non-functional characteristics. Is the separation between data structures and algorithms formally defined? Asked By : Ben Aston Answered By Read More …
[Solved]: How to find contour lines for Appel’s Hidden Line Removal Algorithm
Problem Detail: For fun I am trying to make a wire-frame viewer for the DCPU-16. I understand how do do everything except how to hide the lines that are hidden in the wire frame. All of the questions here on SO Read More …
[Solved]: How to implement the details of shotgun hill climbing to make it effective?
Problem Detail: I am currently working on a solution to a problem for which (after a bit of research) the use of a hill climbing, and more specificly a shotgun (or random-restart) hill climbing algorithmic idea seems to be the best Read More …
[Solved]: Understanding the one-writer, many-readers problem?
Problem Detail: I need some help understanding the implementation of the one-writer many-readers problem shown below as I am new to this concept: I have a rough idea that there will be starvation/deadlock among the readers as there is one writer Read More …
[Solved]: Do linearly dependent features in feature vectors improve the feature vector?
Problem Detail: I was reading Wiki on feature vectors, and as far as I can see, it suggests creating new features from already existing features: Higher-level features can be obtained from already available features and added to the feature vector, for Read More …
[Solved]: Lower-bound complexities for finding common elements between two unsorted arrays
Problem Detail: I’m facing some problems that deal with finding common elements between unsorted arrays and I’d like to know whether there are well-known lower-bounds for the worst-case and, eventually, what are these lower-bounds. The problems are pretty simple: Given two Read More …
[Solved]: What is the difference between consensus and mutual exclusion in Distributed Systems?
Problem Detail: If we can achieve consensus, does it imply we can achieve mutual exclusion? Is there a difference? Example : Paxos solves the consensus problem, can it also be used to solve mutual exclusion? Asked By : Nitish Upreti Answered By Read More …
[Solved]: Complexity of natural language processing problems
Problem Detail: Which natural language processing problems are NP-Complete or NP-Hard? I’ve searched the natural-lang-processing and complexity-theory tags (and related complexity tags), but have not turned up any results. None of the NLP questions that are recommended are helpful, the closest Read More …
