instruction stringlengths 35 29.1k |
|---|
If a graph with $v$ vertices is represented in the form of adjacency matrix .
Then, adding a new vertex to the existing graph requires how much time ?
Is it $O(v^2)$ or $O(2v)$ .
We have the adjacency matrix of the graph with $v$ vertices , by adding a new vertex we have to enter a row (for edges leaving the new verte... |
Is it possible to estimate number of steps in best possible algorithm for classification of messages, using entropy of messages?
E.g. linear search problem. We have an ordered set of incomparable elements (no < and >, equivalence only) of length $N$, and element for search – A, which could be in set maximum once. Set c... |
I was reading page 147 of Goodrich and Tamassia, Data Structures and Algorithms in Java, 3rd Ed. (Google books).
It gives example of linear sum algorithm which uses linear recursion to calculate sum of all elements of the array:
Algorithm linearSum (arr , n)
if (n == 1)
return arr[0]
else
retur... |
Do people consider the implementability of a (abstract) data
structure or a data type, just like people do for
implementability/computability of an algorithm? By implementability, I mean if a (abstract) data
structure/type can be implemented on a real computer or abstract computer model.
Does the implementability of a... |
For an L2 cache that is strictly inclusive of the L1 cache, if a block to be evicted is also present in L1, then back invalidation is required to maintain the inclusion property.
I am interested in some details of how back invalidation is handled.
When an L2 block is evicted, is back invalidation command always sent t... |
In the field of computer vision, we talk a lot about this process of feature detection-description-matching as a way of recognizing objects. But on the other hand, there's also talks about object classifiers and such, but aren't they based on this feature detection description matching?
Is detecting features and descr... |
I am sorting the following list of numbers which is in descending order.
I am using QuickSort to sort and it is known that the worst case running time of QuickSort is $O(n^2)$
import java.io.File;
import java.io.FileNotFoundException;
import java.util.*;
public class QuickSort
{
static int pivotversion;
sta... |
I see a sentence in one final exam on automaton course.
I have one problem: if we want to have a TM that halts for all word in L, it's enough to have L be R.E? or we should have R be R.E and Complement of R be R.E?
Note: (Recursive Enumerable = R.E).
|
The Sieve of Eratosthenes is an algorithm generate the prime numbers, $2,3,5,7,11,13,...$ by drawing a list of numbers crossing out multiples of the smallest number in the list.
Is there anyway to modify this algorithm to search for twin primes up to $N$?
One way would be to, generate the list of primes $p < \sqrt{N}... |
My question seems like an elementary question, but it's really not.
Suppose I have one million cars in a line sorted in alphabetical order by license plate. I am standing at the top of the line with the car with license plate AAA111. I want to find the car with license plate ZZZ999. I could do binary search to find the... |
Let $C = shuffle(A, B)$ denote the shuffle $C$ of two languages $A$ and $B$, it consists of
all strings $w$ of the form $w = a_1b_1a_2b_2....a_kb_k$, for $k > 0$, with $a_1a_2 ··· a_k \in A$ and $b_1b_2 ··· b_k \in B$. Show that if A and B are regular then so is $C = shuffle(A, B).$
|
My objective function, f, is complicated and embodies several disparate constraints I want my simulation to optimize simultaneously. So I can't really even assume it's continuous; it is probably close, in that small changes in the parameter space won't produce big shifts in f, but the gradient, etc. will be undefined a... |
AB
00 01 11 10
00 | x | 1 | 0 | 1 |
CD 01 | 0 | 1 | x | 0 |
11 | 1 | x | x | 0 |
10 | x | 0 | 0 | x |
The answer to the above Karnaugh map is $F(ABCD) = B D + \bar B \bar D + \bar A \bar C \bar D + \bar A C D$
according to my book and the K-map solvers online.
But what I don'... |
Take a graph $G=(V,E)$ .
As we know both DFS and BFS are graph search algorithms .
But why the algorithm for BFS is designed in such a way that it does not cares about the vertices that are not connected to the source vertex $s$ but DFS takes care about all vertices in $V$.
I mean if $G$ has $l$ connected components... |
From what I have read, the main advantage to using tanh(x) or sigmoid(x) as an activation function for neural networks is that it is very easily differentiable.
I am trying to implement a neural network that uses a genetic algorithm for optimisation rather than backpropogation, and therefore it doesnt matter if my acti... |
Given an integer $N$, I want to find the number of numbers $\le N$, that contain at least one of the digits from the set $\{2, 4, 6, 8\}$. How do I go about solving this problem?
I was thinking of constructing all possible numbers that fit into the integer size of the language that I am using, through a recursive proce... |
Is there a problem with this proof that NP = coNP?
It suffices to show that Satisfiability can be solved efficiently with at most a polynomial number of queries to an oracle for Tautology. The algorithm for a problem P is, pick a variable X in P and fix it to T to obtain a problem P'. Submit ~P' to the oracle for Tauto... |
I wonder what differences and relations are between symbol and enumerated types?
A symbol is a primitive datatype whose instances have a unique human-readable form
an enumerated type is a data type consisting of a set of named values called elements, members or enumerators of the type.
Since a data type is a set of v... |
For P algorithms, we say that the execution time can be logarithmic O(log n), lineal O(n), quadratic O(n^2), etc.
For NP and NP-Complete algorithms is there a way to represent the execution time? Or is there a 'standard' way of doing it?
|
I am studying these sorts, but it is still unclear to me which one of these two would require fixed length keys?
|
To cut a wooden board, a sawmill charges proportional to the length of the board. The cost of cutting a single board into many smaller boards will thus depend on the order of the cuts. As an example, lets say cutting a $10m$ board into two pieces costs $10$. Then to cut a $10m$ long board at marked positions $3m$ and $... |
I am implementing an autoencoder neural network in matlab, the weights of which are being optimised by a genetic algorithm.
At the moment I am working on the first layer, trying to get an improved reconstruction from it by using the genetic algorithm.
Using the genetic algorithm, I am able to get about a 30% improvemen... |
One colleage came with the idea/comment that it would be useful to lecture two programming languages, eg. Java and Scheme, at the same time while lecturing an Introduction to Programming course aimed for first term undergraduates.
I have my doubts that approach could stuck some students in learning the syntax of the pr... |
We have $n$ integers with lot's of repeated numbers. In this list, the number of distinct elements is $O(\log n)$. What's the best asymptotic number of comparisons for sorting this list?
Any idea or hint or pseudo code? In fact I want to learn pseudo code.
|
I am trying to design a program where people trade objects within a fixed set of objects. They offer a single product, and designate a set of products they are willing to accept for that product. The job of the program is to involve as many people in a trade as possible.
To do this, I create a directed graph, where ... |
In the proof of Theorem 4 in [GS'12], the authors reduce an instance of PARTITION to their problem. Therefore, they create for each element $a_i$ in the instance of PARTITION a number $2^{c \cdot a_i}$ for a suitable constant $c$, which is later used in the reduction. They argue, that the instance remains of polynomial... |
Suppose that you're given a fair coin and you would like to simulate the probability distribution of repeatedly flipping a fair (six-sided) die. My initial idea is that we need to choose appropriate integers $k,m$, such that $2^k = 6m$. So after flipping the coin $k$ times, we map the number encoded by the k-length bit... |
I'm still learning functional programming (with f#) and I recently started reading about computation expressions. I still don't fully understand the concept and one thing that keeps me unsure when reading all the articles regarding monads (most of them are written basing on Haskell) is the relation between computation ... |
Suppose we have a directory containing $N$ files whose names are numerals, but not necessarily contiguous numerals. Let's say for concreteness that each file contains an email message, each of which has a date, and we would like to rename the files so that the order of the filenames is the same as the order of the dat... |
The upper bound on the runtime of binary search tree insertion algorithm is O(n) which is if it is not balanced
What will be the tighter upper bound on this,will it become O(logn)
I have read that tighter upper and lower bounds are often equivalent to the Theta notation.
|
With conventional collision resolution methods like separate chaining and linear/quadratic probing, the probe sequence for a key can be arbitrarily long - it is simply kept short with high probability by keeping the load factor of the table low. Collisions during rehashing thus aren't a problem as they don't affect the... |
Sorry, I'm really new to neural networks and this question is probably pretty obvious. If you have any resource that can help clarify these concepts to me it would be much appreciated.
The way I understand neural networks is that each input node, x i goes to each hidden layer. Is there a unique weight for each input ... |
I have an optimization problem, whose answer is a real value, not an integer such as vertex cover and set cover. Therefore, the decision version of my problem is given an input and a real value $r$.
I have been able to reduce an NP-complete problem to my own problem in polynomial time. I also showed that my problem is ... |
How we calculate the answer of following recurrence?
$$T(n)=4T\left(\frac{\sqrt{n}}{3}\right)+ \log^2n\,.$$
Any nice solution would be highly appreciated.
My solution is to substitute $n=3^m$, giving
$$T(3^m)=4T\left(\frac{3^{m/2}}{3}\right)+\log^2 3^m = F(m)=4F((m/2)-1)+m^2=O(m^2logm)= O(\log^2 n \log n \log n)\,.$$
|
I understand context switches and threading on a single core system, but I'm trying to understand what happens in a multi-core system. I know multiple threads from the same process can run simultaneously in a multi-core system. However, can multiple processes run simultaneously in such a system as well?
In other words,... |
Comparison-based sorting algorithms does a number of different operations to accomplish the sorting, why comparisons are the dominant time consumption? While I understand the standard analyses of asymptotical behavior of number of comparison operations, I don't quite understand why other costs of other types of opera... |
My question is simply, can linear Diophantine equations be solved in polynomial time? Specifically, I am looking at equations of the form $a_1 x_1+a_2 x_2 + ... + a_n x_n = k$, where $a_i,x_i,k$ are all integers, and solving for $x_i$. The algorithm I am using is based off of the following journal article:
http://www... |
I am new to automata theory. I am well aware of the definition of regular language in automata, that is "a language is called a regular language if some finite automaton recognizes/accepts it" [MS]. However, I'm confused why such language (set of strings) is called regular.
what is regular about regular language?
Is t... |
Given a grammar such as the following, does $S'$ have some special meaning or does it just denote another non-terminal like $B$, $A$, $P$, $Q$ etc.?
$$\begin{align*}
S &\to aBS'\\
B &\to b\\
S'&\to bA
\end{align*}$$
|
Dynamic time warping (DTW) is an algorithm in time series analysis for measuring similarity between two temporal sequences which may vary in time or speed. Here are some explanations of DTW:
Dynamic Time Warping by Wikipedia
Dynamic Time Warping by M Müller (2007)
Is there any algorithm that can replace DTW for measu... |
Let $\Sigma=\{a,b\}$, and let $S(a)$ be sum of the positions of $a$ of string $S$. I want to prove $$L=\{S\in \Sigma^{*} \mid S(a)=0(\bmod 2)\}$$ is regular.
What I was thinking is to do somehow keep track of sum of positions of $a (\bmod 2)$ For that I was thinking to do like take set of states as $\{0,1\}\times \{0,1... |
We have a set $A$ of $n$ distinct numbers. We want to determine for all $x,y,z \in A$ whether the following relations hold.
$$
x+y>z\qquad x+z>y\qquad y+z>x
$$
Anyone could describe $O(n)$ Algorithm?
|
I came across generalized nondeterministic finite automata (GNFAs) in Sipser's Introduction to the Theory of Computation. These are automata where transitions are labelled with regular expressions, rather than single symbols from the alphabet. I thought he would explain why GNFAs are allowed. I mean, an appropriate exp... |
What is meant when somebody says that a problem can be expressed as a $\Pi_1$-sentence?
I know that for the arithmetical hierarchy, a $\Pi^0_1$-sentence is a sentence of the form $\forall n_1\forall n_2\dots\forall n_k \psi$ where $\psi$ is a formula in the language of Peano arithmetic with only bounded quantifiers. An... |
So in biology (DNA sequences), sequence alignment is a generalization of longest common subsequence where an alignment of two sequences is scored typically with a linear function of how many spaces are inserted into each sequence and how many times each possible pair of aligned characters appears in the alignment. Just... |
I'm learning about language metatheory and type systems, and am using coq to formalize my study. One of the things I'd like to do is examine type systems that include dependent types, which I understand is very involved: being able to rely on coq would be invaluable.
Since this type system feature (and other, simpler ... |
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 T3:
For example, given three binary search tree T1, T2 and T3:
Tree 1 Tree 2 Tree 3
... |
I'm trying to understand the difference between weak and strong AI. For an example, let's say we would pass the turing test - would it show strong AI or weak AI then?
I don't believe that this is standard terminology, but more philosophical. It was mentioned by John Searle in his "Chinese room argument". As I understa... |
I know that Big O is used to bound worst case running time. So an algorithm with running time $O(n^5)$ means its running time in worse case is less than $n^5$ asymptotically.
Similarly, one can say that for example merge sort's running time is $O(n^2)$ which is correct. But we know that there is a better bound for it:... |
Question is you're given a DFA. Give an algorithm which tells you whether strings of all lengths $n\in \mathbb{N}$ are acceptable or not.
What I doing was, I have algorithm to count the number of all strings of some fixed length $n$. Now let there are $k$ states. Suppose we got a positive result (i.e the number of stri... |
Main task
In my bachelor degree's thesis I've developed an algorithm for recommender systems which uses personalized PageRank with some particular features as nodes.
In the recommender systems' field, there is the opportunity to understand how good is the algorithm using some accuracy metrics (MAE, RMSE, F-measure, ecc... |
I have a function $f$ given by
$f(x)=nearest\ upper\ power\ of\ two\ of\ x$
For example, $f(5)=8$ and $f(2)=2$.
Are $f(x \wedge y)$ and $f(x+y\mod{N})$ separable over some operator. For example, could we do:
$f(x\wedge y)=g(x)g(y)$
or
$f(x+y\mod{N})=g(x)\ op\ g(y)$
where $op$ is some arbitrary operator.
In other word... |
What are the significant applications of minimum spanning trees?
After doing some research online and in several textbooks, I have found three real-world applications:
Building a connected network. There are scenarios where we have a limited set of possible routes, and we want to select a subset that will make our ne... |
So most resources providing Sudoku puzzles assign a difficulty category to each puzzle, even some I've seen with 15 or more difficulty categories. But what is a good way to assign these difficulty categories? If enough human puzzle solvers were used, the average time for a human to complete a puzzle and the percentage ... |
So, suppose i have a maze, which has a start point and an end point, marked with Orange and red respectively and my goal is to find the minimum distance between them. The blocked path is represented by black colour and the open path is represented by white colour . However there are two modification done in this.
Ther... |
i prepare for Autotmata Course Final Exam.
in one of lecture, our professor draw this Turing Machine, and wrote DELTA is Neutral element of TM.
it'w wrote:
Language of this TM is: {$W \in (a+b)^* : w=w^R$}
but i think x is in alphabet and the language is {$W \in (a+b+x)^* : n_a(w)=n_b(w)$}
$n_a$ is number of a's in w... |
I would like to ask a question about multiple return values, why this construct is not preferrable in programming languages (conceptual and/or technical difficulties). I've heard something about stack frames and how they reserve memory for return value and variable return values could make this problematic, but if some... |
From http://en.wikipedia.org/wiki/Parse_tree
A concrete syntax tree or parse tree or parsing tree[1] or derivation
tree is an ordered, rooted tree that represents the syntactic
structure of a string according to some context-free grammar.
Parse
trees are usually constructed according to one of two competing
relations,... |
As I understand, the generation process of a string in a context free language according to its context free grammar can be represented as a tree.
For a formal language which can have a formal grammar, can the generation process of a string also be represented as a tree?
What kind of trees can identify context-free gr... |
i'm so glad that ask my first question on my favorite site.
Infact i ran into multiple choice question in recent exam on Compiler Course.
Suppose T1, T2 is created with SLR(1) and LALR(1) for Grammar G. if G be a SLR(1) Grammar which of the following is TRUE?
a) just T1 has meaning for G.
b) T1 and T2 has not any diff... |
Given a collection of non-empty subsets of $\{1,2,\ldots,N\}$ ($N$ not fixed), the problem is to find the smallest non-empty collection of subsets so that the number of distinct elements appearing among the union of subsets is less than or equal to the number of subsets chosen. This seems like an NP-hard problem but I ... |
please don't offer an answer about "it's an electronic thing" or something like that, just keep reading.
I don't understand why we use a dictionary, a lexicon, with just 2 elements to express the entire digital world.
My point is about the fact that information is entropy, things that are predictable or just don't vary... |
Lets consider propositional logic. We say a proof system for propositional logic is syntactically (negation) complete if for every $\alpha$, either $\alpha$ or $\neg \alpha$ are provable within the system, i.e., $\Sigma \vdash \alpha$ or $\Sigma \vdash \neg \alpha$. (I assume standard definitions for $\Sigma$ and $\vda... |
I have been doing a lot of research into pattern matching algorithms.
For some background I am searching a long binary alphabet text consisting of considerably more 0s than 1s. The individual patterns I am searching for are of the form 11111, 1*1*1*1*1, 1**1**1**1**1**1, etc, where * is the Don't Care symbol (so eithe... |
I've read in "Introduction to Algorithms" (CLRS) that formal language $L$ is NP-language if and only if there is a polynomial verification algorithm $A(x, y)$ and a constant $c$ such that $$L=\{x\in\{0,1\}\mid \exists y \text{ with } |y| \leq |x|^c\text{ and } A(x, y)=1 \}\,.$$
What is the purpose of the constraint: $|... |
I've been coming across a problem in one of my assignments requiring the calculation of the speedup of a two-way superscalar cpu. The problem is as follows:
There is a two-way superscalar CPU with 2 pipelines U & V. The instruction pipeline U processes the complex instructions, while the instruction pipeline V processe... |
Given inequality $Ax + By \le C$, where $A, B, C$ are integers, $A$ and $B$ are coprime and $C < AB$. I need to find number of non-negative integer solutions of it.
Is there exists algorithm which run in polynomial time? For example if $A \le 10^{10}, B \le 10^{10}$ it should work less than a second. Thanks in advance.... |
I ran into a question about Quick Sort Algorithm.
Suppose in Quick Sort, Partition procedure take C times, (need constant time). if we use random data as input, what is the order (time complexity) of Randomized-Quick Sort?
any hint or solution highly appreciated.
|
I am writing a numeric library to exploit GPU massive parallelism and one of the implemented primitives is a matrix class. Naturally I require a determinant and inverse function for this class and I am having trouble finding algorithms which perform well on a massively parallel architecture where there is no shared mem... |
I'm at the following exercise in Software Foundations:
(** **** Exercise: 2 stars (baz_num_elts) *)
(** Consider the following inductive definition: *)
Inductive baz : Type :=
| x : baz -> baz
| y : baz -> bool -> baz.
(** How _many_ elements does the type [baz] have?
(* FILL IN HERE *)
[] *)
All of the answe... |
There are plenty of details about carry lookahead adders such as Kogge-Stone, Lander-Fischer, etc. in college CS courses. They are described as "common in the industry". However, I can't find any evidence (aside from maybe the Manchester carry chain) from recent times that they are actually used anywhere specifically.... |
I have come across this question:
Let 0<α<.5 be some constant (independent of the input array length n). Recall the Partition subroutine employed by the QuickSort algorithm, as explained in lecture. What is the probability that, with a randomly chosen pivot element, the Partition subroutine produces a split in which t... |
My question is similar to question here Divide self-intersecting polygon
I have points of self-intersecting polygon, its edges and also I am able to find points where it intersects.
I have to divide it into simple polygons and tessellate them later.
I have an issue how we currently select the edge after the intersecti... |
I am creating an event notification system.
Each event has a user and a subject, such that, 'user did event to the subject'. Now while presenting these the events need to be grouped.
All the events in the same group must either refer to the same user or the same subject and each event must be in exactly one group. Su... |
Here's an old puzzle: Let $s$ be a string of decimal digits ($s[i] \in \{0,\dotsc, 9\}$). Define a function $f(s)$ as follows:
Interpret $s$ as a decimal number, $n_{10}$, and convert $n$ to its octal equivalent, $m_8$.
Now treat $m$ as a decimal number, $m_{10}$ and convert it to its hexadecimal equivalent, $h_{16}$,... |
Given a biased $N$-sided die, how can a random number in the range $[1,N]$ be generated uniformly? The probability distribution of the die faces is not known, all that is known is that each face has a nonzero probability and that the probability distribution is the same on all throws (in particular, the throws are inde... |
Let $A$ be a regular language, let $A'=\{xz\}$ such that for some $y,|x|=|y|=|z|$ and $xyz\in A$.
Show that $A'$ is not necessarily regular language.
This is an excercise of Sipser, I've no idea how to construct $A,A'$ please help someone
|
$L = \{P : P(n)$ outputs $n^2$ for all $n \in N \}$
In questions of this nature, are we supposed to assume that "outputs" means "halts and outputs"? In modern programming languages, I can certainly "output" using a print statement and then have the program go into a loop after that.
|
I searched this over Google few times but ended up with articles on transparency rather than an answer.
With relation to distributed database study(or distributed OS), what is the concept of transparency?
I mean in replication, fragmentation and everywhere I guess the idea is to implement these concepts but not to both... |
Is it correct to say that there are languages that a NFA with epsilon recognizes but a PDA is not? I think that it is wrong but I cannot find a suitable explanation.
|
How can I prepare for an introductory CS college course?
I am currently in Grade 12 and next year I will be studying Computer Science at a university in South Africa (syllabus is here). However CS has a very high dropout rate here in South Africa, more than any other course, and I'm nervous because of that. My experien... |
I have a family of acyclic networks in which every path from the source of a given network to its target has length exactly $3$. I'm aware of a publication that in general, finding a max flow in a DAG is no simpler than finding one in a cyclic network, but unfortunately the only places I could find it put a paywall the... |
We define a Pythagorean triple as a triple $\langle a,b,c\rangle$ such that $a,b,c\in \mathbb N$ and $a^2+b^2=c^2$.
In order to avoid duplicates, we say that a triple $\langle a,b,c\rangle$ is legit iff $b>a$.
Let $\mathcal P$ be the set of all legit Pythagorean triples.
We define a lexicographic order $\prec$ on $\ma... |
I have thousands of wireless LTE hotspots. Each month I need to assign each hotspot a rate plan.
Each hotspot uses some amount of data in a month (represented in megabytes). Each rate plan has some amount of data that is included (i.e. 1000 mb). Hotspots that share the same rate plan can "pool" their data allowances... |
I was trying to prove the next exercise 1
It's not look so hard, but with some tries, I couldn't find out a way to show it, I was supposed wrong assumptions.
To convince myself if that relation really happened, I use Mathematica to plot some a range.
Do you have some ideas?
1 Ian Parberry and William Gasarch. Proble... |
Let $U =\{\frac{1}{n}: n\in \mathbb{N}\} \cup \{-\frac{1}{n}: n\in \mathbb{N}\}$ be the set of positive or negative unit fractions.
Given positive integers $m<n \in\mathbb{N}$, how do you find $u_1, u_2 \in U$ such that $|\frac{m}{n} - (u_1+u_2)|$ becomes minimal?
A weaker problem would be the following: Given positive... |
I was given two languages
$$L_1=\{0^k1^k0^m\mid k,m \in \mathbb{N}\text{ and }k < m\}$$
and
$$L_2=\{a^mb^{m+1}\}$$
and I was asked to prove whether they are context free or sensitive.
For $L_1$ : I did pumping lemma and I cannot clearly rule out the context free. So I accepted that it is and tried to do a high level ... |
I'm having a hard time viewing Turing's solution to the Halting Problem as a logician, rather than as an engineer.
Here is my understanding of the Halting Problem:
Let $M$ be the set of all Turing Machines.
Let $i$ be the set of all inputs for all the Turing Machines in $M$.
Let every element in $M$ be an elemen... |
$DoesNotHaltOn\_w=\{(M, w) : M$ does not halt on input w$\}$
$AlwaysHalt =\{ M : M$ halts on all inputs x $\}$
Hopcroft gives the following proof that $AlwaysHalt$ is not R.E.
1) Given an input x of length n, $M'$ simulates $M$ on w for n steps.
2) If during that time $M$ halts then $M'$ loops and $M'$ does not ha... |
Given an undirected graph $G=(V,E)$, two distinct vertices $s,t\in V$, a weight function $f:E \to \mathbb{N}$, and a constant $M\in \mathbb{N}$, does there exist a pair of edge disjoint paths connecting $s$ and $t$, each of which has weight at most $M$? In other words, we are given an upper bound on the path weights, ... |
Am I correct in saying that
traverse(node):
if node is null, return
print node
traverse(node's right subtree)
traverse(node's left subtree)
would produce output that is the reverse of post-order traversal?
post-order(node):
if node is null, return
post-order(node's left subtree)
post-order(... |
I would greatly appreciate your advice on following machine learning problem:
I need to train a classifier to learn a device's behavior. The device itself can be observed under different operating/input conditions through a set of sensors. A sensor yields time series data and we call all observations during an interval... |
I am trying to think of an efficient way to synchronize a tree's nodes with the following rules.
Consider for instance this tree:
so the top of the heap is always B which can have many leaf-type nodes called G, or children which are node themselves called S, which can have leaves as well (G)
it is possible in the futu... |
I read one old-midterm exam on Automata. consider:
the language that accepted by above pushdown automata is not generated by which of the following grammar?
1) S->aBaa|a$\epsilon$
aB->aS|$\epsilon$
2) S->aaB
aB->aaaB|$\epsilon$
3) S->aaB|a
aB->aaB|$\epsilon$
4) S->aB
B->aaB|$\epsilon$
i think (3) is true, bu... |
A certain system consists of 2 CPUs. The CPU that is not being used is assigned to a task whose execution is requested. On this system, two tasks, A and B, are executed.These tasks both use a common resource R exclusively.The CPU usage of the tasks A and B, the usage of resource R and the execution sequence are shown i... |
Assume you have a finite language $L$ succinctly represented as a acyclic DFA $M$ (models can't be much simpler than that :) ).
How can we efficiently sample a word from $L$ with uniform distribution?
Note that counting the number of words in $L$ is easily doable in linear time in the size of $M$, which might be usef... |
I am studying computer architecture. I would like to know the difference between the terms "computer architecture" and "microarchitecture".
|
Is there a program that will tell you the optimal algorithm for ANY problem if the problem is decidable? If not, why not? If yes, how can such a program be realistically constructed?
I would prefer an intuitive explanation over a formal one, thanks.
|
Hello and apologies if my question will be too elementary. My background is from arithmetic geometry, but I have been recently faced with certain computational problems of combinatorial nature, where I feel way out of my league, so I will definitely appreciate some clarity on the matter :)
Long story short, I am faced ... |
During thinking on one problem, I realised that I need to create an efficient algorithm solving the following task:
The problem: we are given a two-dimensional square box of side $n$ whose sides are parallel to the axes. We can look into it through the top. However, there are also $m$ horizontal segments. Each segment ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.