Problem Detail: So I’m reading “Introduction to Machine Learning” 2nd edition, by Bishop, et. all. On page 27 they discuss the Vapnik-Chervonenkis Dimension which is, “The maximum number of points that can be shattered by H [the hypothesis class] is called Read More …
Blog
[Solved]: Introduction into first order logic verification
Problem Detail: I am trying to teach myself different approaches to software verification. I have read some articles. As far as I learned, propositional logic with temporal generally uses model checking with SAT solvers (in ongoing – reactive systems), but what Read More …
[Solved]: What do we know about NP ��� co-NP and its relation to NPI?
Problem Detail: A TA dropped by today to inquire some things about NP and co-NP. We arrived at a point where I was stumped, too: what does a Venn diagram of P, NPI, NP, and co-NP look like assuming P ≠ Read More …
[Solved]: Can subtracting o(1) from the parameter of a function change its Θ-class?
Problem Detail: I would like to know if it is possible that two functions $f(n), g(n)$ can exist such that both of the following conditions are met: $g(n) = o(1)$ $f(n-g(n)) neq Theta (f(n))$ I though I found $1/n$ and $1/n^2$ Read More …
[Solved]: What is the difference between a R-tree and a BVH?
Problem Detail: I’ve just read about R-Trees: The key idea of the data structure is to group nearby objects and represent them with their minimum bounding rectangle in the next higher level of the tree; the “R” in R-tree is for Read More …
[Solved]: How to find longest recurring pattern from lage string data set?
Problem Detail: I need to find the substring that is from a 100,000 characters this substring must be most repeated and it need to be longest substring for example TYUFRIETEYM0SQZLHBCTN0W1KA9HELAT4LTQ14W7ZW484GSK1XTNOBJ2R6AMGW9KU36G7ITMPF315Y7ESYPR1XE2C1953J0DXUNBJLNTDG7IHS63854SGSS7YDEFJYSFP0DLL54GK6NUZ5UU5FRIETEYCPNGHIJOX23QOVSCBYHKE7HRIETEYV0H49I5SX9CW967CDGKX3TYCVNVBNCFGGDGDGDDFIIPGDSDVGDDSRGDGVCZAQRIOPKLMVFGCDGDTYGSDCBGDUSLVAQEFCGDGRIETEYDGDFG In above character set there is two substring one is GD Read More …
[Solved]: Can I simplify log(n+1) before showing that it is in O(log n)?
Problem Detail: Had a question about the following: $$log (n+1) in O(log n)$$ Can the left side be simplified any further or do I need to just go ahead and find a c and n that hold? Asked By : TacoB0t Answered Read More …
[Solved]: Number of winning combination in Nim
Problem Detail: I am studying game theory and I am wondering how many winning combinations are possible for Nim game? Suppose, stones = 500 and piles = 5. With these number, there are many initial game positions are possible. like [1, Read More …
[Solved]: MST with half the edges the maximum weight
Problem Detail: I have been cracking my head over the following question – You are given an undirected connected graph with an even number of edges. Half of the edges have weight less than C (possibly with repetitions), and the other Read More …
[Solved]: How to draw a graph to disprove this statement?
Problem Detail: The Problem: Indicate whether the following statements are true or false: a. If e is a minimum-weight edge in a connected weighted graph, it must be among edges of at least one minimum spanning tree of the graph. b. Read More …
