instruction stringlengths 35 29.1k |
|---|
I came across the following problem in a exam.
We choose a permutation of n elements $[1,n]$ uniformly at random. Now a variable MIN holds the minimum value seen so far at it is defined to $\infty$ initially. Now during our inspection if we see a smaller value than MIN, then MIN is updated to the new value.
For examp... |
I have a homework question about the properties (decidability, Turing-recognizability, etc.) of the language
$$ L = \{ \langle M \rangle | \text{$M$ is a TM and $M$ accepts some string $w$ which has 101 as a prefix} \}. $$
I have made an attempt at showing decidability of $L$:
On input $\langle M, w\rangle$ (where $M$... |
I'm reading "Sets for Mathematics" by Lawvere, and he uses the following metaphor at the end of section 1.3: "we will see...how any abstract set F of the right size can act as mappings between given abstract sets. (For example, in computers variable programs are just a particular kind of variable data.)"
The internet s... |
Any schema that satisfies BCNF also satisfies 3NF. But how can this be true if BCNF does not necessarily guarantee dependency preservation, whereas 3NF guarantees dependency preservation?
|
What are the time complexities of the following code? I posted this on the general stackexchange website, but it was suggested that I post it here.
def func(n):
for _ in range(n):
if n == 4:
for _ in range(n):
<O(1) operation>
It will only be O(n^2) for one specific input (n = ... |
I was studying Paxos from:
http://research.microsoft.com/en-us/um/people/lamport/pubs/paxos-simple.pdf
and I was trying to understand page 4, specifically, the following paragraph:
"To maintain the invariance of $P2^c$, a proposer that wants to issue a proposal
numbered n must learn the highest-numbered proposal with n... |
Please can anyone explain me the worst ,average and best case running time for the Unifrom binary search .. Also how can the lookup table be explained?
|
What is average number of cycles in an undirected ordered graph of size $n$?
I've tried finding out sum of number of cycles in all sorts of a graph of size n but I couldn't find that out.
|
I've been researching on AdaBoost and GentleBoost classifiers, but can't seem to find a clear answer to the question:
What is Adaboost better at classifying in computer vision?
What is GentleBoost better at classifying?
I've been told that AdaBoost is good for things with soft edges, like facial recognition, while Ge... |
I am facing hard time understanding min-entropy.
Fix $v \in \{0,1\}^{n/2}$, let $F\colon \{0,1\}^n \to \{0,1\}^{n/2}$ be chosen randomly, and let $X_v$ be a string chosen uniformly at random among $F^{(-1)}(v)$ (or a special string $\epsilon$ if $F^{(-1)}(v) = \emptyset$). We want to compute the probability that $H_\in... |
Consider the problem:
Given an undirected graph and two of its vertices, is there a path between them?
I often read that this problem can be solved in linear time in the number of vertices! I am not sure why this claim holds.
Can this really be done in linear time (not amortized) without preprocessing?
|
Is there any algorithm which takes edges (given by its two end points), and determines in which cell (or cells) of grid it is?
Grid has fixed dimensions and number of cells. Grid is represented by its cells with matrix. And every cell has list of edges that intersect that cell.
Input is set of pair points, but I can al... |
Is this state machine a moore machine or a mealy machine? I am confused because the states have outputs and the transitions have output based on the input. I tried making a state table but I think its wrong. Can anyone provide the state machine?
|
I was wondering how I could go about creating an algorithm that gets all the cliques in a graph in PSPACE
So far, based on some of the readings I've done, I am considering to use bit-strings (that have a length equal to the number of vertices in the graph). Then, for every possible subset of the vertices, a turing mach... |
The following may contain errors. It is precisely because I am not
sure I understand the topic that I am asking questions. I do not have
books about it and could not find an adequate reference on the web.
I am discussing a problem regarding an enumeration of strings that
should be in amortized constant delay. From what... |
The algorithms for the problem I am working on become more and more complex as I try to improve their performance. They already span several pages with cases and sub-cases, and will probably become even longer. I am worried that there might be mistakes that are difficult to notice.
As a programmer, I am used to writing... |
I was learning some basic sorting techniques with their complexity. However I cannot understand why only the number of comparisons are taken into account while calculating time complexity and operations such as swap are ignored. Link to selection sort analysis. Please help me understand.
|
What is the proof of P ⊆ NP? I cannot happen to find a good explanation for it. I read that the verifier will just ignore the proof and accept any proof if the solution is YES and reject all proofs if the answer is NO. I'm also unclear about verifier.
Definition of P and NP I follow:
P: a problem 'Q' is said to be in ... |
Andrew S. Tanenbaum, in his book Modern Operating Systems (3rd Edition), states that the distinction between operating system software and normal (user mode) software can sometimes be blurred in embedded systems (which may not have a kernel mode).
Can someone please describe more what an OS without a kernel mode looks... |
suppose Threads 1 and 2 are executing concurrently with shared integer variables A, B, and C. Thread 1 executes:A=4, B=5, C=B-A; Thread 2 executes: A=3, B=6, C=A+B;
I'm trying to find what can the possible values of C be after execution of this fragment when synchronization is not implemented.
I know if there is no sy... |
I read in the artificial-intelligence book of Russel and Norvig that The tree-search version of A* is optimal if heuristic function is admissible, while the graph-search version is optimal if heuristic function is consistent(monotone).
An admissible heuristic is one that never overestimates the cost to reach the goal.
... |
Is there a standard way to check if two edges of a graph cross? I'm having trouble coming up with an algorithm to do this, and any insight/intuition into how this can be done would be great.
To be clear, here's an example:
The algorithm would ideally return that the edge shared by 7 and 8 crosses with that between 5... |
I know that CNF SAT is in NP (and also NP-complete), because SAT is in NP and NP-complete. But what I don't understand is why? Is there anyone that can explain this?
|
I'm trying to find a linear solution with a small constant factor but I'm not sure what to search for, or even how to succinctly describe it. The best I've come up with is:
Given a set of rectangles on a plane find the set(s) which allow the same y value for some largest contiguous set of x values. All rectangles ar... |
This is an assignment of an introductory course of complexity theory and I need to find a way to do the following:
Given $n,m \in \Bbb N$, is $n \le m!$ ?
The idea is to provide a Post Machine that can decide this in an efficient way, using $n,m$ in a binary codification.
We know that the factorial isn't efficient, so ... |
There is a basic result in circuit complexity that says:
There exists a language that cannot be solved with circuits of size $o(\frac{2^n}{n})$.
The argument is a simple counting argument on the number of boolean functions and the number of distinct circuits. See, for example, these lecture notes.
I believe it is un... |
I have this context-free grammar and I want to find out whether its language is finite or infinite.
S -> XY|bb Step 1
X -> XY|SS Step 2
Y -> XY|SS Step 3
So I would do
S -> XY From step 1
S -> YYY From step 2
S -> SSYY From step 3
S -> SSSSY From step 3
S -> SSSSSS From ... |
It seems like it would be possible to add more precision to the IEEE 32-bit mantissa system if the leading zeroes were also dropped, just like the leading 1 is dropped due to it being implicitly known.
For example, the number 17 would be represented as 0|10000100|00010000000000000000000. The leading 1 of the mantissa i... |
I am doing a project in order to recognize an apple. (I am using Emgucv with Visual Studio 2010 C#, if that's relevant). My project is a classification (is or is not an apple). I have 2000 images of apples but I need images for the second class.
I have read about classification using ANN but they have multiple classes... |
I am now pretty confident on how I would turn something into a Turing Machine. Now my question is how do you convert TM into a complement of a Turing Machine. From what I can remember in Finite Automata, complementing it you would just turn a start state into a ending state, also if you have an ending state you would m... |
Suppose that $G$ and $H$ are both expander graphs on the same node set with a second largest eigenvalue of $\lambda_G$ resp. $\lambda_H$.
What can be said about the expansion of graph $G \cup H$? In particular, is the spectral gap of $G \cup H$ at least as large as the minimum of the spectral gaps of $G$ and $H$?
Doe... |
Title says it all pretty much. I do realize that often edit distance is defined as the minimum number of operations needed to transform one string to another, but I want something to point to that's even more general than that.
I recently saw a brain teaser that claimed that some string was connected in a network to a... |
As a programmer with non CS background, I am learning algorithms.
When explaining the performance of quicksort in an Algorithm book and also elsewhere on the web, I do not see any reference to the time/space needed for shuffling. I do understand that shuffling is important to have the $O(n\log n)$ performance, but shuf... |
Given an array, say A, with a finite definite length like N (e.g. 1000) can we define a problem to be NP-Complete without any intentional injection of NP-Completeness by something else :
for example questions like this are not acceptable:
"Solve this, NP-Complete, problem using A as an auxiliary array."
Please note tha... |
You are given two things: A fixed initial 'model' partition of an interval, e.g.
I------I---I-----I-------I----...
where each - or I represents an element in a discrete time series and the Is are the partition boundaries. This can also be represented as a sequence of subinterval lengths, i.e. 7, 4, 6, 8, ...
Then, yo... |
System: Application
OS: Scheduler, VMM, IPC, FS Drivers, dispatchers, VFS
The above would be a monolithic kernel. In a monolithic kernel all core OS functions are separate from user spaaaaaace. Functions such as the FS are handled completely by the kernel. This leaves the end user/dev open to write applications that re... |
I am currently learning about Turing Machines, I am curious if a Turing Machine can have fewer states ? Can it be done like a Transition Graph where you can have multiple states at once ?
I got this TM off of a youtube video sorry for bad hand writing, but could I just merge some of the states like you would do in Tr... |
I have to prove the following 2 properties of the Small-step semantics of the WHILE programming language:
If $\langle C_1; C_2, s\rangle \rightarrow^k s'$ then there is a
state $s''$ and natural numbers $k_1$ and $k_2$ such that $\langle C_1;s
\rangle \rightarrow^{k_1} s''$ and $\langle C_2; s'' \rangle
\rightar... |
Let A = $(Q, \Sigma, \delta, S, F)$ be a deterministic finite automaton associated with the language
$L \subseteq \Sigma^*$
$L' = \{y \in \Sigma^*:\exists x\in L. |x| = |y|\}$
$L \subseteq L'$
How do I show that there exist a NDFA associated with L' ?
|
I have a problem that I encountered that boils down to the following:
Considered this directed graph I found on Google:
I have the following information available to me
Node: Ancestors
1 : 3
2 : 1 3 5 7
3 : Null
4 : 3 5
5 : 3
6 : 1 2 3 4 5 7
7 : 1 3
8 : 1 2 3 4 5 6 7
How can I re-construct the original graph in a r... |
Many of us are familiar with the $P$ class. Counting solutions is believed to be a difficult task and that is why we usually end up approximating the number of solutions (we relax the accuracy of the counting). I want to ask, if relaxing the quality of the solutions counted has been addressed as a problem. Is there for... |
On the following picture, we have overlapping polygons: we know the positions of vertices and the edges for each polygons, and the intersections are exactly known (vertices at the intersection are represented on the figure). Is it possible to 'partition' the domain spanned by the union of these polygons into 'disjoint'... |
Is my (very high-level) understanding correct here regarding quantum algorithms —
Quantum computers can process a massive amount of operations in parallel to the nature of qubits and their ability to have states that are superpositions of $|0\rangle$ and $|1\rangle$.
Yet when we measure the qubits all the possible stat... |
Can we define instructions as expressions with side-effects?
|
Consider two sets: the set of validities of propositional logic and the set of validities of monadic predicate logic. Call the first set $VP$ and the second set $VQM$. Both of these sets are decidable, so there are Turing machines that recognize both them and their complements.
I'm interested in how the decidability o... |
An associative array is a set of pairs (key, value).
Does it represent a mapping, or a relation (i.e. does it allow the same key to be associated to different values)?
Does it represent an injective mapping only, or does it allow different keys to be associated to the same value?
Can a hash table implement any associa... |
Let $M$ be a square matrix with entries that are $0$ or $1$ and let $v$ be a vector with values that are also $0$ or $1$. If we are given $M$ and $y = Mv$, we can computer $v$ if $M$ is non-singular.
Now let us take the second bit (from the right) of the binary representation of each $y_i$ as another vector $z$. So ... |
In the multi criteria decision making context, let $\mathcal{A}$ be a set of alternatives or choices. Each alternative $\alpha\in \mathcal{A}$ is a vector of $k$ criteria $\alpha=(v_1,v_2,\dots,v_k)$. Let $\geq_1,\dots,\geq_k$ be a set of $k$ partial orders over $\mathcal{A}$.
For any two alternative $\alpha,\beta\in ... |
I'm taking a graduate course on the theory of functional programming, based on Paul Taylor's "Practical Foundations of Mathematics." I understand the statement of Tarski's theorem about how for any $\omega$-compelte poset $X$, and any $\omega$-continuous function $T:X\rightarrow X$, that $T$ has a fixed point which is... |
I am doing a project to recognize a kind of leaf using ANNs with Emgu CV in C#. My project is to get frames from camera then present them to the ANN and have the ANN tell me if that frame contain a leaf or does not contain a leaf.
I am using 1000 images of leaves that I want to recognize, so if the frame contain a lea... |
Let me ask my general question using a specific example, namely range searching:
Given a set of points in the plane and an axis parallel rectangle, report all points lying in the rectangle.
If the rectangle contains $k$ points, then this can be solved in $O(\log n + k)$ time (after some preprocessing). I understand th... |
The question is:
How many different undirected graphs are there with n nodes and no parallel edges but may include self-loops?
I've been wracking my brain over this for hours now. Basically, I know that for 1 vertex, there are 2 graphs. For 2 vertices, there are 8 graphs. For 3 vertices, there are 64 graphs. However, I... |
Is it theoretically exist a computer that never affected by computer virus?
just wonder if there could be a revolution on the computer?
|
I'm trying to show how to reduce the Partition problem to the 3-Partition problem.
I'll first describe the problem using the definitions and notations I'm familiar with (I hope they're legit), and will then ask my question.
So, the Partition problem is as follow:
Given a multiset of integers $X$, we have to decide whet... |
I'm a GCSE Computing student and I've been asked to compare writing programs in a block programming environment (I think this means using programs such as Scratch or App Inventor but I'm not entirely sure) compared to writing programs using high level programming languages such as Python, Java etc.
I'm honestly not try... |
We know that if an edge is a part of a cycle in an undirected connected graph $G$, then if we remove that edge the graph is still connected.
Is the opposite true? If an edge is not a part of a cycle in a connected graph $G$, and we remove that edge, then the graph we get is disconnected?
P.S.: I think that it is true, ... |
(Re-posted from StackOverflow as suggested)
I have the following problem.
The functions $f(x),g(x)$ are defined as
$$
f(x) = \begin{cases} f_1(x) & 0 \leq x \leq 10, \\ f_2(x) & 10 < x \leq 20, \\ 0 & \text{otherwise}, \end{cases} \qquad
g(x) = \begin{cases} g_1(x) & 0 \leq x \leq 5, \\ g_2(x) & 5 < x \leq 20, \\ 0 & \... |
1) Is there a better algorithm than the naive O(|E|.|V|) to compute the number of descendants of each vertex in a DAG?
2) Is there an online algorithm to do so, assuming that nodes are added one by one and connect to a non empty subset of the existing nodes?
Context: I'm interested in the case where m = O(n), millions ... |
I am looking for articles relating to algorithms that deal with automatic selection of seating assignment.
I need an algorithm (preferably more than one) that can automatically select a seating place while enforcing certain constraints that are predefined.
Originally I was planning on having the seats selected on the f... |
In class yesterday we went over DFA's and DFA acceptable languages. An example of a language that is not DFA acceptable was given as $\{ ab, aabb, aaabbb, aaaabbbb, \ldots \}$. The reason given was that the machine would need an infinite amount of states.
But wouldn't a simple DFA that has only one state that is a ... |
I have an idea of how a C program is turned into machine code by the compiler. I also know how the processor processes the instructions (https://www.youtube.com/watch?v=cNN_tTXABUA this video has a good introduction). But what I don't understand, is how an operating system (most times written in C or some low-level lan... |
Have a question that requires me to write the rules for parsing a turing machine
This is the question
The PROBLEM involves writing a set of Turing Machine rules that will read and determine whether or not an input corresponds to the rules of a Turing Machine. This is the first step of a Universal Turing Machine. For ex... |
From purely my knowledge of computer science a simple breadth first search from root A in search of node B, while keeping track of the depth of the tree, would be the most effective way to check whether A and B have 6 degrees of separation. If I simply wanted to check whether B is within 6 degrees I could also limit my... |
I'm studying for my finals and I can across this statement.
"For a fixed set of (unique) keys, any binary search tree containing those keys can
be converted to any other BST on the same set of keys via a sequence of left- and/or right-
rotations."
I'm interested in a proof. Does anyone know any references?
|
I need a regular language $ L\subseteq \{0,1\}^{*} $ so that $unary(L)$ is not context free.
unary of $L$ is defined by:
$$unary(L) = \{0^{1x} : x \in L \}$$
Example $L = \{0, 11\} $ $\rightarrow unary(L) = \{00, 0000000\}$
Any help would be great.
|
I need to find a function $f$ which is in $o(\log^{k} n)$ for fixed value of $k$ with $f = \omega(1)$. I know that for little $o$ the function should be strictly less than $c\log^k n$ for all $c$ and large enough $n$; and for little $\omega$ it should be strictly greater than $c\cdot 1$ for all $c$ and large enough $n$... |
I have two True or False questions in my practice test that are related but I am unsure about:
1. If an optimization problem can be solved using a greedy algorithm,
there must be a solution for this optimization problem using dynamic programming as well.
2. If an optimization problem can be solved using dynamic progr... |
I'm looking for public algorithm which gives the engine these abilities:
Query by ranked terms
Limit outcome by date/time range
Basically, i'd like to concentrate articles (generally title|text|timestamp) identify the source and make N-N correlation to terms (is term for datasource same marking as term for dataentry?... |
I'm ordering functions by their asymptotic growth for an assignment and I have verified I have the correct order by using limits, but I'm trying to understand why $n^{log\ log\ n}$ is between $n^3$ and $2^n$. It seems like it should be closer to the order of $n^n$. Can anyone provide some insight on this.
|
So I've been thinking about verifiers and a possible relation between a language's class and it's verifier complexity. From the book, "NP is the class of languages that have polynomial time verifiers". Is there an analog statement that can be said about a P-class verification complexity? Because P is a subset of NP, I ... |
What I understated is this:
Probabilistic algorithm: an algorithm that produces result in determined time with a confidence value about the probability of the produced result being correct.
Randomized algorithm: an algorithm that uses some sort of randomization to reach the result, that too with absolute surety of reac... |
I am trying to obtain the proof of the proposition:
$(\forall x \in \mathbb{N}, P(x)) \vee (\neg \forall x, P(x))$
given that the property $P$ is decidable for every $x \in \mathbb{N}$, i.e.
$\forall x \in \mathbb{N}, P(x) \vee \neg P(x)$
This is easy to prove (even without using the decidability of $P$) if I include t... |
I am trying to prove that 3SAT is polynome time reducable to CNF-SAT, but I don't know how to do this. A formula F is in 3SAT iff f(F) is in KNFSAT, but since 3SAT is a part of KNFSAT, every formula that is in 3SAT will automatically be in CNF-SAT. Is my conclusion correct? And how do I actually show this in a correct ... |
I'm trying to understand the material in "A Dual Coordinate Descent Method for Large-scale Linear SVM" by Hsieh et. al. (link to paper) There is an equation for the Dual form of an unconstrained optimisation problem,
$$
f(\mathbf{\alpha})=\dfrac{1}{2}\mathbf{\alpha}^T\bar{Q}\alpha-e^T\alpha
$$
I don't understand what t... |
i'm a little bit lost ... can you help me ?
So I have this table of date (each row give a point with its group)
So i took a random weight let's say : [1, -2]
H = 1 if n =< 0
0 otherwise
a= H([1,-2][6,3]) = H(0) = 1 but the target output is 0 ... so we have to update the weight:
w -> w - p = [5 , -5] .
Next :
a= ... |
Reading the Wikipedia article for common terminology for tree (data structure) there are several near references, but I don't read a formal declaration for how to refer to a specific generation of a tree's subtrees.
For example,
Definition
As a data type, a tree has a value and children, and the children are
themselve... |
Let me preface this question by giving some helpful background material.
I'm trying to solve the traveling salesman problem using branch and bound. Concretely, for a partial solution, I'm using the solution the algorithm would attain by making greedy choices as an upper bound, and comparing this bound to the current b... |
Java seems to be categorized as a statically-typed language [1], but I'm wondering if it would be accurate to describe it as generally statically-typed but having some dynamic typing because of the run-time type checks performed when downcasts are performed.
|
For simplicity, we can assume that only NAND gates are allowed. An asymptotically correct solution is all I really need.
Thanks!
|
I got a problem related to graph theory -
Consider an undirected graph ܩ where self-loops are not allowed. The vertex set of G is
{(i,j):1<=i,j <=12}. There is an edge between (a, b) and (c, d) if |a-c|<=1 and |b-d|<=1
The number of edges in this graph is
Answer is given as 506
but I am calculating it as 600, please ... |
I'm working with compression algorithms that use context-free grammars (e.g. RE-PAIR and SEQUITUR). These grammars look for frequently occurring digrams (pairs of adjacent symbols) in an input string and use recursive substitution with non-terminal symbols to achieve compression.
What I'm wondering is whether there ar... |
I asked this on StackOverflow, but it was determined more appropriate to post here.
So it goes like this..
For people concerned about users having slow connections and timeout issues, it is known that it can't be just always solved with minification, latency reduction etc..
I'll try to keep this question as short as po... |
In an article I am currently reading the grammar
S → SS | a | ε
is being described as canonical infinitely ambiguous. The infinitely ambiguous part I have no problem recognizing, but does "canonical" mean? Does it mean "typical", "standard example" etc.?
|
I'm looking for a good definition of sparse graphs. Is a sparse graph effectively a big one, with millions/billions of nodes? An example from real world is the Facebook graph. Or can sparse graphs be in small networks as well?
|
I'm reading this Intel white paper on carry-less multiplication. It describes multiplication of polynomials in $\text{GF}(2^n)$. On a high level, this is performed in two steps: (1) multiplication of polynomials over $\text{GF}(2)$, and (2) reducing the result modulo an irreducible polynomial. We use the "standard" bit... |
I have started to read about user-based and item-based collaborative filtering techniques. I understand how a rating of the target user for a particular item is predicted. How top-N recommendation list is created in user-based/item-based collaborative filtering??
|
Someone told me that the $\log$ function was introduced to make the calculation easier. If we have to calculate $xy$, we can calculate instead $\log x+\log y$ since $\log xy=\log x+\log y$. How this can make the calculation easier? Maybe from a mathematician point of view but what about a computer scientist's point of ... |
I am coding a procedure that takes an integer $d$, and generates $d$ finite lists $X_1 \ldots, X_d$ of elements. I would then like for it to output a list of the elements in the product set $X_1 \times \cdots \times X_d$.
I can't use nested for-loops because $d$ can vary so I wouldn't know how many to nest. I'm sure t... |
Does anyone know any good introductions to Formal Language theory and Formal Grammar, that cover the mathematical basis of Syntax and things like context free grammars and pushdown automata. In particular, I'd like to be able to understand:
-Parikh’s theorem
-Pentus' proof that Lambek-calculus grammars define only cont... |
Suppose I have a source node $S$, destination node $D$ and a set $A$ of intermediate nodes $P_1, P_2, \dots$ in an edge-weighted undirected graph. I want to find the vertex $P_i\in A$ that minimizes $\mathrm{dist}(S, P_i) + \mathrm{dist}(D, P_i)$? In addition, the overall path from $S$ to $D$ should contain only one n... |
I know that if the set of free variables for a relational calculus query is equal to the set of range-restricted variables then the query is (roughly) safe. I also can identify free variables. However, I do not understand what range-restricted variables are at all, and I can't find any comprehensible explanations anywh... |
I've been reading up on boosting algorithms.
I understand that the main crux of the algorithm is to build weak classifiers that are slightly better than random guessing, and then to add them up so that we end up with a strong classifier. This is done via "boosting rounds".
With different papers using different variable... |
I am familiar with describing Regular Expressions but when it comes to describing CFG I get confused. Do you describe it in words like you would regular expressions or do you do something like this ?
this is the CFG I am trying to describe
S -> SS
S -> XXX
X -> aX| Xa| b
I was thinking something like this
S-> SS
-... |
I've read this which describes how to do do integer arithmetic in circuits. The one thing that it does not describe is how to do these operations with a modulus. How can modular arithmetic be done in circuits? Can someone point me to a resource or describe the modular step here?
|
Could anyone help me with this algorithmic problem:
Given the in and out degrees of a set of vertices, is it possible to determine if there exist a valid graph respecting this constraint? The graph can allow self loops but not parallel edges.
Here's an example:
Vertex A: in=1 out=1
Vertex B: int=2 out=2
For which we ... |
Students will identify certain students they want to work with. I have therefore decided to split them into two groups where I want to minimize the number of people in Group 1 who want to work with students from Group 2.
I was thinking about creating a source node s, and creating a node for each person ($p_i$) - follo... |
I have always had a hard time making sense of infinities.
Example: the language $L = \{ \epsilon , 01, 0011, 000111, 00001111, ... \}$ is not DFA acceptable because a machine capable of accepting it would require an infinite amount of states.
I can draw a DFA with ellipses in the middle to represent it's expansi... |
Say I have part of a query in the form: ∃xa(...)∧∃xb(...)∧∃xc(...), where a, b, and c are attributes and the ellipses can be anything (I'm looking for a general rule). Is this equivalent to saying ∃xa,xb,xc(...∧...∧...) - i.e. compacting all the existential quantifiers into one and 'anding' their domains together?
For... |
That's the problem
$$y=(x,w,\rho) = \begin{cases}
1 & \sum_{i=1}^3 w_ix_i >\rho\\
0 & \text{otherwise}
\end{cases},$$
where $x=\{x_1,x_2,x_3\}$ are inputs, $w=\{w_1,w_2,w_3\}$ are weights and
$\rho$ is the threshold value.
The problem asks to find an opportune set of weights that can
classify these inputs.
$$A = \{(... |
How do people measure performance overhead? Whenever someone is bragging about how their program or application performs better than another, they talk about particular measurements, eg time, performance etc.
Whilst I understand how time to perform a task can be calculated, I cannot understand how performance is measu... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.