instruction stringlengths 35 11.4k |
|---|
I am trying to categorise subfields of computer science. Wikipedia does a good job of it.
However, it cannot fit cloud computing, virtual machines, containers and related technologies in any of the mentioned fields.
Does it fit under computer architecture or do we need a new sub-field?
I know categorising topics under ... |
Let
\begin{align*}
L_1 &=\{\langle M,w\rangle \mid M\text{ halts on }w\}\\
L_2 &=\{\langle M,w\rangle \mid M\text{ does not halt on }w\}\,.
\end{align*}
Here $M$ represents encoding of a Turing machine (T.M.) and $w$ is the input string. What is the class of $L=L_1 \cup L_2$?
I read that the union would be a ... |
I'm trying to understand how the $word2vec$ method actually nudges word vectors of similar semantic/syntactic content closer together in the word vector space.
I've read here (Quora answer) that it's because $word2vec$ tries to maximise the probability of target word $w$ given context $c$, and that this probability is ... |
Suppose a disk has
Number of surfaces: 8
Number of sectors per track: 20
Sector size: 4000B
Number of tracks: 10
It is rotating at 360 rpm.
So disk is reading data from one track at an instance. So I will only find for a single rotation how much data can be fetched & I will find how much data in 1 second.
In 60 second... |
I've only been studying computer science for a few weeks, so I apologize if this is a silly or naive question.
Suppose we're trying to list all elements of the set $$C(r) = \{(x,y,z) \in \mathbb{N}^3 : \sqrt{x^2+y^2+z^2} \leq r\}.$$
An obvious approach would be this: first, list all integers between $0$ and $r$; these ... |
I got a array of colors that are closely related = most of the time there is no sharp transition between color[n] and color[n+1].
Exemple of such an array of colors
[0,.1,.2,.3,.4,.5,.6,.7,.8,.9,1.0,.8,.6,.4,0.2,0]
You'll notice that there are 3 "special" values. The colors
slowly increase from value 0 to 1 (in 10 ste... |
As per the book "Introduction to Algorithms" , to solve the rod cutting problem for a given length n, we basically iterate over all possible lengths of the first part , and calculate the optimal profit for the remaining part ( either through recursion or via stored values in array ). The profit for the first part is pi... |
Say that we have some (integer) weights $w_{1,1},w_{1,2},...,,w_{m,m}$ and a target sum $W$.
Suppose that we want to find whether there are $a_1,...,a_m \in \{0,1\}$ such that
$$\sum_{i = 1}^{m} \sum_{j = i}^m a_i a_j w_{i,j} = W.$$
I read through the Wikipedia article on the quadratic knapsack problem. It mentions (b... |
I have an extremely large (100GB+) corpus of many different texts. All of them are in English and 'well' formatted. They are not loaded into any kind of database, think of them as a huge collection of text files of many different sizes.
What would be the most efficient way to check and retrieve arbitrary text sequences... |
Let we have some problem $A$. Input length is $n$. Now we write a database that will store info about some positive instances of problem $A$. For every $n$ size of $n^{th}$ sector of DB is $O(f(n))$. $f(n)$ is some function.
Then we assume that some solver for problem in complexity class $C$ (for example, $GI$) can use... |
I want to store a subset of $\{1,2,\dots,n\}$ in a data structure such that the total space used is $O(n)$ bits and accessing a particular element can be done in $O(1)$ time. I have tried binary search tree and array data structures but they are too slow.
In short I need a data structure with $O\big(\frac {n } { \log \... |
Bucket sort algorithm lets you sort an array of $n$ elements in expected $O(n)$ time, supposing the elements are equally distributed in the $\lbrack 0,1 )$ interval.
Is there a way to modify the bucket sort in order to sort in expected $O(n)$ time an array of $n$ elements distributed in $\lbrack 0,1)$ according to the ... |
I got this question that's been troubling me for some time.
If $h_1$ and $h_2$ are admissible heuristic functions, prove that $h_3 = (c-1)\,h_1 + c\,h_2$, $0 < c < 1$, is also an admissible heuristic function.
The thing that I get stuck on, and maybe get a little tunnel-vision, is that $(c-1)$ is negative which preve... |
Let's say i make a program that produces an eleven character long ID like youtube does and tries to find a valid video in youtube. What's the actual possibility that it's going to produce a valid ID corresponding to a real video and also an unlisted one??
|
In this image there is a given formula in DNF and CNF. When I check it on Wolfram Alpha I see that it cancel out (E or D) because of (not A or A) which is colored in red. My question is if it is allowed to cancel out (not A or D) because of (not E or E) which is colored in green instead. THX
|
I have this [kind of funny] question in mind. Why is the non-deterministic finite automaton called non-deterministic while we define the transitions for inputs. Well, even though there are multiple and epsilon transitions, they are defined which means that the machine is deterministic for those transitions. Which means... |
$L_0=\{\langle M,w,0\rangle\mid M \text{ halts on } w\}$
$L_1=\{⟨M,w,1⟩\mid M \text{ does not halts on } w\}$
Here $\langle M,w,i \rangle$ is a triplet, whose first component $M$ is an encoding of a Turing Machine, second component $w$ is a string, and third component $i$ is a bit.
Let $L=L_0 \cup L_1$. Is $L$ non R.E... |
The following is an excerpt from the book "An Introduction to Formal Languages and Automata" by Peter Linz.
My question is, why is $\Sigma^+$ used and not $\Sigma^\ast$?
|
I'm trying to calculate the best and worst position for each team in the ranking based on the weekly matches.
Suppose we have 4 teams with these position:
Pos.| Name | Pts.
1 | Team A | 12
2 | Team B | 10
3 | Team C | 8
4 | Team D | 6
And during the week there are 2 matches A vs C and B vs D
If you don't k... |
I'm trying to implement the Fortune's Algorithm, however I can't quite figure out how the status structure should be implemented.
The following is extrapolated from my Computational Geometry book.
The beach line is represented by a balanced binary search tree
$\mathcal{T}$; it is the status structure. Its leaves co... |
I have a value that increases by unknown increments at unknown times. Given a time, I need to check how much it has increased between that time and now.
I could simply store every time/increase pair whenever the value is increased, but this would be too much data to reasonably store.
For example:
DATA:
Value = 0 @ 0:... |
The following is an excerpt from the book "Introduction to the theory of Computation" by Michael Sipser, 2nd edition.
As per the book, this Turing machine accepts the language L = { w#w | w ∈{0, 1}*}. I ran this machine for few strings and it's working properly.
My doubt is, I think there is no need of keeping a trans... |
With Levenshtein distance we can create a metric space over string. Is there are any distance metrics for regular expressions?
|
I'm trying to better understand the min-cut problem for directed acyclic graphs. I understand that the minimum capacity cut has equal capacity to the max flow of a graph by the max flow-min cut theorem (https://en.wikipedia.org/wiki/Max-flow_min-cut_theorem). This makes some sense to me but I'm confused as to what happ... |
Let's say I have a decimal floating-point number, i.e. a mantissa and precision (negative exponent), both represented as integers. How do I convert this into a binary floating point number (of the sort you find in most programming languages, with only the standard operations available). This should be done with maximum... |
I'm trying to determine correlation between two structured data sets.
Eg:
D1
name: ABC
age: 3
address: xyz
D2
name: ABC
dob: x/t/r
occupation: xyz
Is there a way to use Pearson correlation on structured data instead of variables?
|
From a programming language designer's point of view, how is "symbolic"
insertion implemented as opposed to "textual" insertion using pre-processor
macros?
I understand the basics of how "textual" insertion works in C and C++. That is,
the pre-processor might transform:
#include "person.hpp"
class employee
{
pers... |
I take the definition from Computability and Complexity Theory by Steven Homer and Alan L. Selman, 2011.
In their book they said that the domain of a computably enumerable (c.e.) function (f) can be the range of another partial function (p). In particular, the partial function can be the universal Turing machine. The ... |
I have two questions about sorting for posets, one easy and one hard:
Easy: Suppose we have a set of objects and a partial order. Given any two objects such that $a \leq b$, we want to delete $b$ from the set. Is there a sub-quadratic time algorithm that can accomplish this, perhaps for some suitable data structure?
Ha... |
Ok. I know this is probably a commonly asked question. Before you refer me to a site or answer this yourself, I ask for you to please read this through. I have been into computers and electronics for quite a while. I have a pretty good understanding of electronics, and would like to become a computer hardware engineer ... |
Theorem. If and only if SAT instance $\varphi$ is satisfiable, there is a way to negate variables in $\varphi$ and get $\varphi'$ where all clauses have at least one positive literal.
Also we can change word 'negative' by 'positive'.
For example, let we have an instance $(x\lor y\lor\overline z)\land(\overline y\lor\ov... |
I am trying to find a description for canonical form (labelling) for a graph. Specifically, how do we arrive at canonical form for a given graph?
|
Let $L$ be CFG. Is $\{ w \in L : wx \in L, \textrm{for some } x \neq \epsilon\}$ also CFG?
|
I am working on writing an easy to read document about denotational semantics of the lambda calculus. For that I introduce CPOs, monotonicity and continuity.
A CPO is a set $M$ with a partial order $\leq$ and a bottom element $\bot$, requiring $\bot$ to be the smallest element in $M$ and the existence of the least uppe... |
Well, I should have posted this question before Why NFA is called Non-deterministic?. Anyways now this is pondering in my mind.
Why people who came up with this automaton theory restricted the input format of it as a read-only, symbol-stream tape.
Is it not so that if we provide random accessible input tape (as in cas... |
I'm currently trying to write an algorithm that can find individual groups of connected lines within a larger set of lines. The images below should explain this a bit more clearly.
In the first image you can see a set of lines. What I'm trying to do is split those lines into 3 groups, as seen in the second image. The... |
In my last exam this question got asked and i just cant find a clear answer:
If P=NP, which two languages are NOT NP-complete?
So I assume there are two special languages, but which?
Thanks in advance
|
My question stems from something mentioned in the following paper*:
Acyclic Multi-Way Partitioning of Boolean Networks by Jason Cong, Zheng Li, and Rajive Bagrodia
Given a DAG representing a Boolean network, $N$, where each node represents a logic gate, define a k-way partitioning solution as $S = (A_1, A_2, ..., A_k)$... |
When implementing a term rewriting system, one “optimization” one can do is to represent operators known to have certain equational properties with a more directly representative data structure. For example, one can use lists to represent uses of a binary operator known to be associative, rather than using the naïve s... |
I'm new to asymptotic notations and right now I'm trying to prove that $n^4 = \mathcal{O}(2^n)$.
In my current solution (written below) I used L'Hôpital's rule repeatedly, proving that the limit of $n^4/2^n$ goes to zero. Is this correct?
Additionally I'm wondering whehter there is a simpler solution to this problem. ... |
I'm trying to solve this problem for big numbers (up to $10^9$). Namely, let's define $$GCD(a,b) = GCD(a-b, b)$$
We define GCD as function that returns greates common divisor of two numbers.
In case if $b > a$ we swap the values of $b$ and $a$. Now I want to count the number of steps when either $a$ or $b$ will be equa... |
Suppose that my multicore computer system has the diagrammed memory caches.
+---------+---------+-------------------+
| CPU 1 | CPU 2 | CPU 3 | CPU 4 |
+---------+---------+---------+---------+
| Level 1 | Level 1 | Level 1 | Level 1 |
| cache | cache | cache | cache |
+---------+---------+---------+---... |
My basic idea of networking at the lowest layer is that one computer will send a bunch of parallel bits at a time down a cable and another computer will read these bits. For example, computer #1 sends a bunch of parallel bits to computer #2. Computer #2 then gets the bits then waits for the next bunch of bits. And s... |
Let we resolve only two clauses at time and then get rid of them. Such resolution clearly takes $O(n)$ steps.
Sequence is a set of instructions in the form $(C_{S_1}\cup C_{S_2},v\cup\overline v),...$, where $S_i$ denotes a set of merged clauses, $v\in C_{S_1},\overline v\in C_{S_2}$.
Of course such resolution taken de... |
It's an exercise I was given:
We say array of numbers $A$ is geometric if:
It has size $n=2^k-1$
It has $\log n$ distinct numbers
For each $0\leq i \leq k-1$ there exists an element in the array that appears exactly $2^i$ times.
For example: $[8,5,2,5,5,5,8], k=3$
I need to sort the array in $\mathcal{O}(n)$ time a... |
A jet which can fly no more than R kilometers without refilling, is at location 0 and needs to fly to point N+1. There are some petrol stations on the way, some of which are ready to use, others are under construction and will be available soon.
We get an array C of length N, where the value of C[i] describes the petro... |
I was reading DeepMind's paper on I2A's and realized that the sizes of the hidden layers in their model were all like 32, 64, 256, and so on: all powers of 2. I have found the same thing in other papers.
Is there any performance reason for it? Maybe related to data structure alignment?
More concretely, I would like to ... |
I'm trying to reconstruct graph if we have given the result of floyd-warshall algorithm, more formally:
Let's say we have given undirected weighted tree (graph without cycles) with $N$ nodes, such that from this graph we only have given matrix $g$ of size $N \cdot N$ elements, such that $g(i, j)$ gives the shortest pat... |
This question is motivated from this post. Let $G$ be a given graph, for each vertex $v \in V$, I will label $v$ with $Triangle(v)$.
$Triangle(v) : $ means number of distinct triangles contain $v$.
Question : Is it a valid canonical form? Is computing this function easy (mean polynomial time)?
|
I'm currently reading Knuth's proof about O(1) number of probes in
linear probing. I have a small question on the page 536 (Volume 3, 2nd Edition). Knuth says
Let $f(M, N)$ be the number of hash sequences such that position 0 of the table will be empty after the keys have been inserted using linear probing.
The cir... |
I have tried to calculate the maximum number of times the loop will search through this large array, but I am not sure if I have that correct and I also need help with or pointers of how I can calculate the number of minimum times it will search through the array using both the binary search and sequential search. Here... |
This page says following:
Integer Multiplication has an O-optimal linear-time algorithm on a RAM or SMM
Is this page fooling me or how can we multiply 2 numbers in linear time (bitwise complexity) using RAM?
|
All variable names are from Quicksort's wikipedia page's Lomuto's and Hoare's quick sorts pseudocode.
If p is what is returned by the partition function, Hoare divides his array from lo to p and from p+1 to hi, while Lomuto divides his array from lo to p-1 and from p+1 to hi.
I may be wrong about this, but Quicksort's ... |
I am reading a free book on algorithms
http://www.cse.iitd.ernet.in/~Naveen/courses/CSL630/all.pdf
and on page 13 it says
"Compare this to the recurrence relation for Fn: we immediately see that T(n) ≥ Fn"
I do not understand how they know that T(n) ≥ Fn
if someone could explain it to me it would be much appreciated.... |
Let G be the grammar:
S --> ASB | λ
A --> aAb | λ
B --> bBa | ba
Use set notation to define L(G).
So I came across two different answers to this question, none of which are mine, and then compared them to mine. I'm wondering if they are all equivalent.
Answer 1: $L(G) = \{a^{n_1}b^{n_1}...a^{n_k}b^{n_k}b^{m_1}a^{m_1}..... |
Is there any way to find an element in an unsorted doubly linked list given an element and pointer from which we can navigate? (we can't use head/tail pointers since the list is infinite)
|
In my algorithm class my teacher said that we should always use counting sort when we want to sort integers. After he said this I was curious to know in which situations I should choose one sort algorithm over another.
Looking at the complexities of the worst cases of the algorithms I know (heapsort, mergesort, quickso... |
I'm new to analyzing time complexities and I have a question. To compute the nth fibonacci number, the recurrence tree will look like so:
Since the tree can have a maximum height of 'n' and at every step, there are 2 branches, the overall time complexity (brute force) to compute the nth fibonacci number is O(2^n).
Now... |
Recently i got a question in one of my exams about asking for an algorithm which searches an element in a sorted array such that $A[i] = i$. My algorithm was based on binary search and did a $O (\log n)$ order of comparisons.
The other part of question demanded to prove there exists no other algorithm which does better... |
I have an x*y bit matrix where the total number of bits fluctuates between ~1,000,000 and ~20,000,000 bits. The rows are much smaller than the columns. An example matrix might be of size 1,000,000 x 20. The percentage of 1's in this matrix is around 15% and these 1's can occur anywhere within the matrix, with the remai... |
If a policy yields an action for a state, how come a 3-state MDP with 2 possible actions, i.e. $S = \{Hot, Mild, Cold\}$, $A = \{East, West\}$, has 8 possible policies? Isn't it 6 if there are 2 possible action for every state?
|
Given $n_1$ and $n_2$ number of verteces and the adjacency matrix for both graphs, one should determine whether $G_2$ is a subgraph of $G_1$.
I am supposed to use C++ for this, and though I could probably come out with a solution including $20$ for functions, it's most likely not the best approach to the exercise.
Do I... |
Let's denote $IS(G)$ to be the size of the maximal independent set in $G$.
Consider the following language:
$$A = \left \{ G\ |\ IS(G)\ge \frac{1}{5}n \right \}$$
I know that $gap-IS [1/8 + \varepsilon , 1/4-\varepsilon]$ is $NP$-hard.
How can I infer that $A$ is $NP$-hard by utilizing the gap problem?
|
I am having some trouble understanding the notion of the VC dimension. The definition I have is the following:
The VC dimension of a set of hypothesis functions $H$ is the cardinality of the largest set which $H$ can shatter. We say that $H$ shatters some set $S \subseteq \mathcal{X}$ if we can realise any labelings o... |
Are there any guidelines for how to recognize, for a given problem, which approach is more likely to yield good results? SAT solver or SMT solver?
Is there any guidance anyone can offer about which sorts of problems can be handled better by SAT solvers than by SMT solvers, or vice versa?
|
I am reading a free algorithms textbook http://www.cse.iitd.ernet.in/~Naveen/courses/CSL630/all.pdf
and on page 13 i am stuck on an example they give.
"At this time, the fastest computer in the world is the NEC Earth Simulator, which clocks 40 trillion steps per second. Even on this machine, fib1(200) would take at... |
My goal is to understand the exact differences between SoEMT, SMT and "time-slice multi threading".
Thus far I already found information on SoEMT and SMT and it does not seem to hard to find more on google. However my problem is: Time-slice multithreading. The best I found - apart from a long winded book, was:
– Proce... |
Please bear with me, since I have just started working on this.
Assuming that the laws of thought apply.
The basic goal of the algorithm is to recast the statement into true or false premises and check if a true and false clashes. If there is a clash then the statement or the set of statements is/contains a paradox. Th... |
I know how to use the master Theorem for a general formula e.g. $T(n) = a \cdot T(\frac{n}{b}) + f(n)$.
I saw some books suggest that we can use the mastere theorem for formulas like:
$T(n) = T(\frac{n}{5}) + T(\frac{7n}{10}) + O(n)$
How is that possible?
My guess: We use it separately. Once for $T(n) = T(\frac{n}{5}) ... |
Currently I'm trying to understand a proof of the statement:
"A language is semi-decidable if and only if some enumerator enumerates it."
that we did in my lecture. One direction of the proof goes as follows:
Let E be an enumerator that enumerates L. We construct a TM M, that semidecides L in the following way:
Given... |
Let we have a SAT instance where every clause has length $\ge3$ (when length $2$ is allowed, it can be unsatisfiable) and each pair of literals appear only once.
Non-example: $(x\lor y\lor z)\land(x\lor y\lor t)$. Here a pair $\{x,y\}$ appears twice.
Example: $(x\lor y\lor z)\land(x\lor\overline y\lor\overline z)$. $\{... |
I'm working in a project to create levels for a videogame using genetic algorithms.
I'm using a undirected graph to represent the level, each node represent a room and each room have a maximum of four possible connections (north, south, east, west). Also each connection just have one compatible connection (North <=> So... |
I am learning about the OS.
I know: that Address Space Size = # of pages x page size
So if I increase Address Space Size, then the number of pages increases:(not the page size). However, isn't the Virtual Page Number a one-for-one mapping to Physical Page Numbers(frames), so if the number of pages increases with the ad... |
For hobbyist reasons I wrote a program which takes the equations of the logic gates of a digital circuit as input, does some analysis, outputs the analysis results and generates program code for doing logic simulation.
Combinational logic is not a problem but sequential logic is:
Currently my program requires you to sp... |
Consider the following definitions of CPOs, monotonicity and continuity:
The pair $(M, \leq)$ is called CPO (complete partial order), if
$M$ is a set,
$\leq$ is a partial order on $M$,
there exists a least element according to $\leq$ in $M$ (called bottom, $\bot$),
for every chain $m_0, m_1, m_2, \dots$ in $M$ its sup... |
Assume that the model of computation is a standard Turing machine model with input alphabet $\Sigma = \{0,1\}$, work alphabet $\Gamma = \{0,1,\_\}$, 1 input tape, 1 work tape and 1 output tape.
We can build a Turing machine $U$ that accepts a (reasonable) binary representation of a Turing machine $M$ and simulates it (... |
I have just started learning algorithms and data structures and I came by an interesting problem.
I need some help in solving the problem.
There is a data set given to me. Within the data set are characters and a number associated with each of them. I have to evaluate the sum of the largest numbers associated with each... |
As turing machine always halts on dead configuration,so consider the case where it halts in final state,if on second last state by reading an input alphabet it comes to final state. Now in final state it will try to find the transition for the next symbol(i.e blank) and as there will be no transition on final state so... |
It might just be a stupid question but I simply see no obvious reason why dependent sum type is a generalized form of product type. Concretely, the sigma type $\Sigma(x:S)T$ degenerates to a product type if $T$ does not depend on $x$ and is expressed to be $S\times T$ in this case.
Where the SUM part in dependent sum t... |
My first thought was using the third case of the master theorem, but I am not sure if I can use $\epsilon \rightarrow 0$, so $f(n) \in \Omega(n^{log_2^4+\epsilon})$.
Otherwise, I tried solving the equation by iteration where I got $T(n) \in \Theta(n^2log_2^3n)$ instead of $T(n) \in \Theta(n^2log_2n)$.
Which solution is... |
I have a stream of jobs (so I don't know upfront how many jobs). And I have N workers in the system.
Now I want to schedule / queue a job to one worker (a worker can have multiple jobs in his queue).
However, it's not the case that the workers can equally well do all jobs (think delivery -- delivery people who are clos... |
I have a knapsack problem that has been frustrating me for weeks, in which we consider a set of n items, described by their integer value, and being of one of C colors.
There exists a constraint on the number of different colors of objects in the knapsack (but no "weight" constraint), and the goal is to maximize the va... |
Everyone knows code bloat is a real thing, of course.
Everyone knows that programs are getting bigger too (this may be nothing to do with 'bloat' of course - they are more sophisticated, safer or faster even: maybe).
So why can't I find any papers on Google Scholar or in the ACM Library that back up either claim?
Happy... |
Problem: Prove that if a Mealy machine is strongly connected and completely specified, the corresponding Moore machine will also be strongly connected and completely specified.
My approach so far:
As the Mealy Machine is completely specified, we have 2 cases for each state:
All transitions coming into this state have ... |
In this blog the author states that the following
So we now have a rather poor estimate of the number of values in the
dataset based on bit patterns. How can we improve on it? One
straightforward idea is to use multiple independent hash functions. If
each hash produces its own set of random outputs, we can recor... |
Question : To show that any language $L \in NP$ is many one reducible to HP.
Let $L$ be a language in NP, it means there exist a non-deterministic Turing machine for $L$. Let $x$ be a input string to this non-deterministic Turing machine, now I have come up with $f(x)$ such that $x \in L \equiv f(x) \in $HP and $f$ s... |
I have an edge-colored network, in which edges also have a length, and I am considering the problem of determining the shortest Path between a pair of nodes, with the additional constraint that the number of colors of edges in a path should not exceed an integer $k$.
It corresponds to finding shortest Paths on a multi... |
Suppose I want to show by contradiction that the amortized cost of a data structure with some operations cannot be less then $\Theta(k)$. I assume for the sake of contradiction that it is possible. Can I then choose an $n$, large enough, and a special sequence of operations and show that they take $\Theta(nk)$ and conc... |
I'm trying to understand the log-space algorithm for $$UCYCLE = \{ \langle G \rangle \ | \text{ $G$ is an undirected graph containing a cycle} \}$$
The basic idea is traversing from every $v\in V$, remembering the first edge and checking if we got back to $v$ from another edge.
What I don't quite understand is the way ... |
Given a Boolean function $f$ over the set of variables $X =\{ x_1,...,x_n \}$, the influence of $x_i$ is defined as the probability that changing only $x_i$ on random input changes $f$.
Given a function $f$ presented in $\text{CNF}$, and a coordinate, are there any known methods for determine if the coordinate has posi... |
I am reading from "Discrete Mathematics and Its applications" by Kenneth H. Rosen, 7th edition. Consider the highlighted part in the following example taken from the same book:
Question Use predicates and quantifiers to express the system specifications “Every mail message larger
than one megabyte will be compressed... |
Say I have 2 Gaussian sources X and Y. They are generated with mutivariate gaussian distribution with mean = [0, 0] and co-variance = [1, 0.9;0.9, 1] with 100 observations
That is: means is zero and both X and Y are correlated with 0.9 and in total there are 100 variables for each of them.
I wanted to convert these cor... |
Is the language $L = \{ w \mid w \in (a,b)^* \wedge w \text{ is not a palindrome} \}$, context-free? I think this grammar:
$
S \rightarrow aSa \mid bSb \mid aAb \mid bAa\\
A \rightarrow aAa \mid bAb \mid aAb \mid bAa \mid a \mid b \mid aa \mid ab \mid ba \mid bb
$
generates it, but I'm unable to conclude anything using... |
I am writing a 2D light casting algorithm with OpenGL compute shaders.
The algorithm is simple:
For each light source shoot out light rays from it, the ray begins at the light coordinates, it ends at a pixel in a circle around the light source (the light distance). When calculating the ray sample the pixel underneath i... |
I've an hash (base 32 for what it's worth):
hash = 'ab352eghjhngd4'
And I've subscribers that want to listen to new hashes in a range.
listener = { startAt: 'ab31', endAt: 'ab40', obj }
listener2 = { startAt: 'ab350', endAt: 'ab351', obj }
In this case listener1 should be notified of the new hash while listen... |
I am doing a small project which explains how operations (file open, file write etc.) are done in client side and server side in network File system. Can anyone help me out providing its source code so that i can track its operation.
It would be helpful if you can explain how the process takes place in real time.
|
Can I use an infinite alphabet for the tape in a turing machine?
e.g. with input string as (1, 0)*
can I define the symbol 1j as the symbol 1 with j marks on top of it where j in a natural number, to be used on the tape?
|
Is it possible to find a TM with O(n) complexity that finds the middle of an input string?
Or at least to prove that it cannot be done?
I can use a two-taped TM if it helps.
|
I'm trying to model a scenario where there are n items, each having weight and volume. We also have m number of knapsack, each having a weight and volume capacity, where these items need to go inside. A feature that I am looking for is that the value property of each item which depends on which knapsack it goes into. F... |
I'm studying the Minimum Test Collection problem and I can't find an example of some instance of the problem, given values to the sets. The Garey and Johnson book only contains the proof of its NP-Completeness.
I hope someone can give me an example in order to understand in a better way the problem.
The problem is def... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.