instruction stringlengths 35 29.1k |
|---|
I'm conflicted whether to post this here or in either math.stackexchange or mathematica.stackexchange.
Define a "simple zonotope" to be a regular $2n$-gon which is tiled by the following rule: all tiles are rhombi. They key point here is that rhombuses have equal side lengths (say equal to 1), but their shapes are allo... |
I've been looking for an algorithm which divides an undirected, weighted, planar and simple graph into $k$ disjoint subgraphs. Here, the graph is sparse, $k$ is fixed, and there are no negative edge weights. After cutting, each subgraph must be connected (i.e. there must be a path between any two vertices of the subgra... |
Given an NFA, is there a way to “take its complement” and obtain an NFA that recognizes the complement language?
|
I am looking for geometry algorithm.
I have an axis-aligned box $B$ and a triangle $T$ in 3D space. I want to compute an axis-aligned bounding box of their intersection.
Both $B$ and $T$ are convex polytopes and $B\cap T$ is also convex polytope. I don't need general algorithm, I need something fast and simple.
Have yo... |
A typical way of proving the greedy choice property of the fractional knapsack problem is as follows:
From Slide 5 of this link:
Given: A set of items $I = \{I_1,I_2..I_n\}$ with weights $\{w_1,w_2 ... w_n\}$ and values $\{v_1,v_2 ...v_n\}$. Let $P$ be the problem of selecting items from $I$, with the weight limit $K$... |
Updated based on comments:
In what ways can we distinguish a human being doing certain activities online and a bot programmed to do similar activities, say checking email, downloading some music files, shopping on ebay, searching on Google etc., or maybe trying to deface/hack a website, brute force a log-in password et... |
From the above image, while trying to maintain an AVL tree data structure, how would the tree look after inserting the value 10? Also, if anyone has any suggestions or simple method of rotating, feel free to share. I am a bit lost with this idea of maintaining a certain height in this data structure.
|
Given an sorted array of integers, I want to find the number of pairs that sum to $0$. For example, given $\{-3,-2,0,2,3,4\}$, the number of pairs sum to zero is $2$.
Let $N$ be the number of elements in the input array. If I use binary search to find the additive inverse for an element in the array, the order is $O(\l... |
I have implemented a neural network (using CUDA) with 2 layers. (2 Neurons per layer). I'm trying to make it learn 2 simple quadratic polynomial functions using backpropagation.
But instead of converging, it is diverging (the output is becoming infinity)
Here are some more details about what I've tried:
I had set the ... |
I found the paper "On the State Minimization of Nondeterministic Finite Automata" which, I assume, contains the Kameda-Weiner algorithm that I've been searching for. It's behind a paywall though. I'm just a hobbyist. Can someone explain it, or point me to another source?
|
I've only recently learned anything substantial about finite automata, and I've just come across some things I hadn't seen before. Specifically, that classic NFAs are ∪-NFA, and there are also these things ⊕-NFA , ∩-NFA and ⋆-NFA (I love unicode). These can all be seen in http://fastar.org/publications/PresentationFEW2... |
I've had a bit of experience programming Neural networks but I am fairly new with genetic algorithms (I'm only 17). I have a major issue that I can't understand. If a child get's one chromatid from one parent and another from another parent, then the genes are crossed over, how do you determine which alleles are active... |
Are there classes of problems that cannot be solved by an oracle machine? If so, are there specific problem examples of that class of problems?
Even the Omega number, at least the first N digits, could be computed as the Oracle could just return TRUE or FALSE for each {0,1}-digits...
|
This problem is the same as
number of ways to partition n into exactly m parts.
The recurrence given in Wikipedia has
p(n,k) = the number of partitions of n using only natural numbers ≥ k
How to find no of partitions of n which has exactly k non-zero parts? Is there a recurrence relation to solve this?
|
Is there a data structure to keep a list of elements (not necessarily sorted) that performs the Access (by index) and Insert operations in a reasonable asymptotic time?
When I say "reasonable time", I mean that it should be equal to or better than $O(\log N)$.
I'm looking for a structure similar to a dynamic array, but... |
How do you construct a DFA from a language that has a + sign? e.g. $L = \{(a+b)\}*$
|
Are there classes of problems that cannot be solved by an oracle machine? If so, are there specific problem examples of that class of problems?
Even the Omega number, at least the first N digits, could be computed as the Oracle could just return TRUE or FALSE for each {0,1}-digits...
|
According to CLRS, the Prim's algorithms is implemented as below --
$\mathtt{\text{MST-PRIM}}(G,w,r)$
for each $u \in V[G]$ do
$\mathtt{\text{key}}[u] \leftarrow \infty$
$\pi[u] \leftarrow \mathtt{\text{NIL}}$
$\mathtt{\text{key}}[r] \leftarrow 0$
$Q \leftarrow V[G]$
while $Q \ne \emptyset$ do // ... $O(V... |
When implementing a parallel version of an algorithm, what is the impact of synchronization delays on speedup efficiency? Does this depend on the platform used?
Is coarse-grained parallelism better than fine-grained parallelism in certain situations?
|
Let language $\mathcal{L} \subseteq \Sigma^*$ be regular.
A factorization of $\mathcal{L}$ is a maximal pair $(X,Y)$ of sets of words with
$X \cdot Y \subseteq \mathcal{L}$
$X \neq \emptyset \neq Y$,
where $X \cdot Y = \{xy$ | $x \in X, y \in Y\}$.
$(X,Y)$ is maximal if for each pair $(X',Y') \neq (X,Y)$ with $X'\cd... |
I am presently using an doubly linked list (C++ std::list) to hold a bunch of records that each have a unique integer identifier. The linked list is created in sorted order such that in the list, the next item always has a larger unique identifier than its predecessor.
The issue I'm facing is that occasionally I need ... |
I want to know how to calculate total number of nodes in a perfect balanced binary tree with $n$ nodes in the last level. I know the answer is $2\cdot 2^{\log n} - 1$. Just curious how this can be calculated
|
I'm trying to understand algorithm complexity, and a lot of algorithms are classified as polynomial. I couldn't find an exact definition anywhere. I assume it is the complexity that is not exponential.
Do linear/constant/quadratic complexities count as polynomial? An answer in simple English will be appreciated :)
|
This is the first time I will be studying compilers in depth. Can someone point me to best online resources (courses, articles, tutorials, video etc ) and books?
My main aim will be to do some practicals instead of just reading theory.-something where theory practical goes in parallel. So the reference must fulfill ... |
I am looking for references for the following problem:
I have a very special class of regular languages and my aim is to express (and to justify my conjecture) that this class itself is very small in some way (as a subset of the regular languages) and that the languages contained in this class are rather "bloated".
F... |
I am trying to figure out difference between fully- and quasi-reduced BDDs. I have read a lot of material but still it is not very clear. As I am trying to figure out the quasi reduced version for union between two BDDs.
The algorithm for union between two fully-reduced BDDs is
bdd Union(bdd p, bdd q)
//fully-redu... |
Suppose I have a decision problem $D$ and I encode it to a language $L \subset \{0,1\}^*$. Now, I can also encode it to a different language $L'$.
Is there any theorem relating the time complexity of $L$ and $L'$?
How does the time complexity of a problem change with different encodings of the same problem?
|
I'm curious about two things.
When we define the class called "probabilistic polynomial-time algorithm" in computer science, does it include polynomial-time algorithm with exponential space?
For example, when algorithm is considered to be given a input from domain $\{0,1\}^n$,
what if the algorithm internally querie... |
This is a question from the book Data structures using C and C++ by Tenenbaum. Not a homework problem but self-study.
Recursive definition of a+b, where a and b are non-negative integers, in terms of successor function succ defined as
succ(int x)
{
return(x++);
}
I have been thinking how is it p... |
When I work on an algorithm to solve a computing problem, I often experience that speed can be increased by using more memory, and memory usage can be decreased at the price of increased running time, but I can never force the product of running time and consumed memory below a clearly palpable limit. This is formally ... |
I get used to think exhaustive search and combinatorial search are same, but I got confused by reading a paper!
What is the difference between exhaustive search & combinatorial search ?
|
I'm trying to find an algorithm for a motion planning problem. I have $N$ points, $P_1$ to $P_N$, in $k$-dimensional cartesian space, defining $N-1$ segments. The problem is about constructing the fastest motion plan, that is, a function $p(t)$, approximating the path along the segments, bound by some constraints:
For... |
It seems that on this site, people will often correct others for confusing "algorithms" and "problems." What are the difference between these? How do I know when I should be considering algorithms and considering problems? And how do these relate to the concept of a language in formal language theory?
|
While reading a cryptography textbook, i find the definition of a function that is hard on the average.(More precisely, it is 'hard on the average but easy with auxiliary input', but i omit latter for simplicity.)
Definition : Hard on the average :
$h:\{0,1\}^*\to \{0,1\}^* $ is hard on the average if there exists a p... |
While reading the paper Holistic twig joins: optimal XML pattern matching I came across the pseudo code for liststack algorithm. (available through google scholar)
A function in the algorithm confused me, since I can understand what it is supposed to do, but can't deconstruct the notation:
$\qquad \mathtt{Function}\ \m... |
This is the first time that I'm looking in depth into the topic, although I've always been curious.
Could someone let me know about online resources (courses, tutorials, etc) and books that cover the basics of the topic?
I'd like to explore both the theoretical part and the more practical part of Data Mining.
|
According to the Wikipedia article on polynomial-time approximation schemes:
All problems in FPTAS are fixed-parameter tractable.
This result surprises me - these classes seem to be totally different from one another. FPTAS characterizes problems by how easy they are to approximate, while FPT characterizes problems ... |
Given a list of pairs $(a_1,b_1),\ldots,(a_n,b_n)$, where all $a_i \geq 0$ and all $b_i > 0$, my general problem is when we can use linear subset scan (described below) to solve the optimization problem of finding the optimal combination of pairs,
$$I^* = \hbox{argmax}_I F(\sum_{i \in I} a_i) / G(\sum_{i \in I} b_i)$$
... |
Question:
Suppose I have a
set of male people, and
a function isAncestor(person1,person2) that checks whether person1 is an ancestor of person2 in O(1) time. Eg, isAncestor(grandfather, grandson) would return true.
What are some fast algorithms for constructing a complete "family tree" by using only this informati... |
I don't "see" why the following syntax is equivalent to the second
syntax1:
E -> E + T
E -> T
syntax2:
E -> T E'
E' -> + T E'
E' ->
(it is to avoid left recursion and I am not understanding why the solution works)
How do I mathematically prove that both syntax definitions are equivalent
|
Currently, I'm delving into Analysis of Algorithms and I've discovered that I would need to improve my knowledge of Probability Theory. Any recommendation? Where do I start?
Thanks in advance!
|
I want to detect cycles in an undirected graph such that I get a list of all edges/vertices which form each cycle. For a graph G({a,b,c,d}, {a-b, b-c, c-d, d-a, b-d}) this would be {a, b, c, d}, {a, b, d}, {b, c, d}.
I have read this and I think that when the iterative pseudocode from Wikipedia finds a back-edge then I... |
I have a problem $\Pi_1$ that I want to show that is NP-hard. I know that I must find an NP-hard problem $\Pi_2$ and a polynomial time reduction $f()$ from instances of $\Pi_2$ to $\Pi_1$ such that $I_2$ is an Yes-instance of $\Pi_2$ iff $I_1=f(I_2)$ is an Yes-instance of $\Pi_1$.
What if I find a (constant sized) fami... |
Given two context-free languages $L_1$ and $L_2$, the language given by the difference of the two languages, $L_1 - L_2$, is (in general) not context-free. Is it possible to prove this without using pumping lemma?
|
I have
two red-black trees $T_1$ of black height $H_1$ and $T_2$ of black height $H_2$
such that all the nodes $N$ belonging to $T_1$ are less than (in value) all the nodes $N$ of $T_2$
and a key $K$ such that $K$ is greater than all the nodes of $T_1$ and less than all the nodes of $T_2$.
I wanted to devise an algo... |
I would appreciate an intuitive way to find the time complexity of dynamic programming problems. Can anyone explain me “#subproblems * time/subproblem”? I am not able to grok it.
Code for LCS -
public static String findLCS(String str1, String str2 ) {
// If either string is empty, return the empty string
if(nu... |
We have a switch with $2$ lines of input and $2$ output. Each line is $10 Mbps$. The size of packets is fixed and is $1KB$. The $1^{st}$ line of input is active (transferring packets) $40\%$ of the time, while the $2{nd}$ line is active $70\%$ of the time. $\frac{1}{4}$ of packets of input $1$ (with arrival) directed t... |
I'm reading the book: Formal Syntax and Semantics of Programming Languages. I don't understand this exercise:
Consider the following two grammars, each of which generates strings of correctly balanced parentheses and brackets. Determine if either or both is ambiguous. The Greek letter ε represents an empty string.
<st... |
From the Introduction section of Homotopy Type Theory book:
Type theory was originally invented by Bertrand Russell ... It was later developed as a rigorous formal system in its own right(under tha name "$\lambda$-calculus").
Can anyone explain me this sentence? I'm having trouble seeing $\lambda$-calculus as a type ... |
I have here a directed graph that I used to perform Dinic's algorithm to find maximum flow. I need to adjust this graph and this algorithm to work with dynamic trees (i.e. the Sleator-Tarjan algorithm).
I just wish I could find an image source or video that can help me visualize the steps. Something like this is really... |
Below is an algorithm for union of two quasi reduced BDDs p and q resulting in r.
bdd Union(bdd p, bdd q)
local bdd r;
1 if p=0 or q=1 then return q;
2 if q=0 or p=1 then return p;
3 if p=q then return p;
4 if Cachecontainsentry⟨UnionCODE,{p,q}:r⟩ then return r;
//p.lvl = q.lvl in case of quasi reduced BDDs
5 r ← ... |
How can I write an algorithm which inverts a 2-level BDD? It should take as input a 2L-level quasi-reduced BDD rooted at $r$ encoding a relation $R : B^L → 2^{B^L}$ and returns the 2L-level quasi-reduced BDD rooted at $s$ encoding the relation $R^{−1} : B^L →2^{B^L}$, that is, $j \in R(i) \iff i \in R^{−1}(j)$.
|
Let $k\in \mathbb{N}$ be fixed. The naive way to compute a sequence of values $a_1^k,\ldots,a_n^k$ where $a_i\in \mathbb{N}$ for all $1\leq i\leq n$ is compute $a_i^k$ individually with the exponentiation by squaring. This takes a total of $O(n\log k)$ multiplications.
Is this optimal? What if for each $a_i$, we have ... |
I need help to understand Chaitin's elegant program proof. An elegant program is the shortest program that produces a given output.
Here is the proof:
Construct a program $B$ that takes as input a number $N$ and enumerates all possible programs $P_k$ longer than $N$. $B$ runs the elegance tester $\mathrm{ET}$ on each ... |
How does one implement a space efficient data structure that satisfies the requirements below?
You have a large array
You have a filter which tells you which elements in that large array are to be deleted
Lookup of i'th element in the array should be constant time
The space formerly occupied by deleted elements in the... |
Considering a grammar that includes a dictionary or list with an optional terminal separator - e.g.:
$$
\begin{align}
obj \to & dict \\
&\mid OTHER \\
dict \to & \{ \quad \} \\
& \mid \{ \quad pairs \quad \} \\
pairs \to & pair \quad ,? \\
& \mid pair \quad , \quad pa... |
Can you provide an example of NN algorithm failure on the Euclidean traveling salesman problem?
I was trying to construct a specific example of this for my friends and was failing.
|
I recently realized that there is some sort of relation between Russellian type theory and type systems, as found e.g. in Haskell. Actually, some of the notation for types in Haskell seems to have precursors in type theory. But, IMHO, Russell motivation in 1908 was to avoid Russell's paradox, and I am not sure how that... |
After learning Haskell and other not so pure FP languages I decided to read about Category theory. After gaining good understanding of Category theory I started thinking about how the concepts of category theory can be used to think about designing programs but no matter how hard I tried it seems this is not the way to... |
For my Bachelor's thesis, I consider the class of languages recognized by symmetrical DFAs, that is, deterministic (complete) finite automata satisfying the following condition:
Let $A$ be a complete DFA over the alphabet $\Sigma$. If, for every $a\in \Sigma$ and every transition $u \stackrel{a}{\longrightarrow}v$ in ... |
In the following function, let $n \geq m$.
int gcd(n,m)
{
if (n % m == 0) return m;
n = n % m;
return gcd(m, n);
}
How many recursive calls are made by this function?
$\Theta (\log_2 n)$
$\Omega (n)$
$\Theta (\log_2(\log_2 n))$
$\Theta ( \sqrt{n} )$
I think the answer is $\Theta (\log_2(\log_2n))$, ... |
The proof of the undecidability of $A_{TM}$ in Michael Sipser's textbook* contains the definition of a Turing Machine, which accepts the encoding of a TM, if this TM doesn't accept its own encoding, and rejects it, if it does. If this TM is run on its own encoding, there is problem: it should accept if it doesn't accep... |
It's known that the following language, the so-called acceptance problem is undecidable:
$A_{TM} = \{\langle M,w\rangle\,\vert\,M\text{ is a TM which accepts }w\}$
The proof is by contradiction: Assume there is a TM $H$ which decides $A_{TM}$. Let $D$ be another TM. Given the code of a TM $M$, $\langle M\rangle$ as inp... |
My question is related to this question posted on math.SE:
Given an odd number, what is the quickest (constant-time) algorithm for finding its largest factor and suppose you can call a helper function $B$ which takes as its input $(N, k)$ and outputs True iff $N$ has a factor greater than or equal to $k$? Obviously, t... |
I wanted to define syntax for a graph path considering it may branch out anywhere.
For instance, I have a path going from a to e following b, c, d: a, b, c, d, e.
Let's consider it (may) branches from b now: a, b, (x | y), d, e which actually means three different paths:
1) a, b, d, e
2) a, b, x, d, e
3) a, b, y, d, e... |
Wikipedia Pushdown automaton (as of aug 16, 2013) states:
In general, pushdown automata may have several computations on a given input string, some of which may be halting in accepting configurations. If only one computation exists for all accepted strings, the result is a deterministic pushdown automaton (DPDA)
My p... |
As a software engineer, I write a lot of code for industrial products. Relatively complicated stuff with classes, threads, some design efforts, but also some compromises for performance. I do a lot of testing, and I am tired of testing, so I got interested in formal proof tools, such as Coq, Isabelle... Could I use one... |
This problem arose from software testing. The problem is a bit difficult to explain. I will first give an example, then try to generalize the problem.
There are 10 items to be tested, say A to J, and a testing tool that can test 3 items at the same time. Order of items in the testing tool does not matter. Of course, fo... |
I need to prove that this language is in co-NPC:
$\{ \langle M,x,1^n \rangle \mid M $ is a TM and for all $c \in \Sigma^*$ , $M$ accepts in $ $$n$ steps when given $(x,c)$ as input $\}$.
I tried to do so by showing that the complement is in NPC, that is $\{ \langle M,x,1^n \rangle \mid M $ is a TM and there exists $c ... |
Similar questions have occurred quite a number of times (1) (2) (3), but I have, say, a specific instance of one. I'm aware of a bunch of applications of finite automata, but would you provide an academic exposition of applications of finite state machines (like, e.g., Mealy machines) in cryptography and ciphers? There... |
If we have an array $A$ of length $N$, which is partitioned into $\sqrt{N}$ adjacent subarrays $A(i)$, each of which is monotonically ordered from $\min(i)$ to $\max(i)$ (it is known what places have those bounds in A for each subarray), with the following conditions:
min(i) < min(i+1),
max(i) < max(i+1),
min(i+1) < ma... |
I have the following Bayesian Network and need help with answering the following query.
EDITED:
Here are my solutions to questions a and b:
a)
P(A,B,C,D,E) = P(A) * P(B) * P(C | A, B) * P(D | E) * P(E | C)
b)
P(a, ¬b, c ¬d, e) = P(a) * P(¬b) * P(c | a, b) * P(¬d | ¬b) * P(e | c)
= 0.02 * 0.99 * 0.5 * 0.99 * 0.88 = 0... |
If the set of regular languages is closed under the concatenation operation and is also closed under the reverse operation ($x^R$ is the reverse of $x$) then is the language generated by $$\{ww^R|w\in\Sigma^*\}$$ for some input alphabet $\Sigma$, also regular? If not, why not?
I've been trying to find a proof for this ... |
Tag systems are Turing-complete. I was wondering if there is any easy way to create tag systems that simulate finite automata. So create tag systems that recognize languages, e.g. by having at the end just one output symbol "A" for accepting the initial input or "R" for rejecting it.
I guess a solution would be to make... |
I wonder why in JavaScript
0.1 + 0.2 // return 0.30000000000000004
4%0.1 // return 0.09999999999999978
http://jsbin.com/oHISAfU/1/edit (Example)
In C the math.h library fmod function
printf("%f", fmod(4.0,0.1)); // print 0.100000
http://ideone.com/RG5Wyv (Example)
And in Spotlight (search feature in the Mac OS X... |
I just read that IBM's Watson would have a hard time answering questions like "tell me about your first kiss." If you asked a modern, state-of-the-art chatbot questions like "tell me about a song that means a lot to you and why" or "tell me about a time when you felt vulnerable" would the chatbot be able to answer in w... |
I am trying to think if we can have an injective mapping $\mathcal{f}$, say something like $\Sigma_{bool}= \{0,1\}^* $ to $\Sigma_{5} = \{0,1,2,3,4\}^* $ such that $|x| \leq 2.|\mathcal{f}(x)|$
The motivation here is simple, consider I have a word $110110110110110110110$, so i can compress and represent that as $(110)^... |
Is there common formal definition of Document in information retrieval field? In many researches authors don't define the term Document(maybe because it is evident for them). Wikipedia says "text file, document (computer science) a computer file that contains text" but it doesn't seem as common formal definition.
Do y... |
Imagine that an algorithm A runs in worst-case time $f(n)$ and that algorithm B runs in worst-case time $g(n)$. Answer either yes, no, or can’t tell and could you explain me why?
Is A more faster than B, for all $n>n_0$ if $g(h)=Ω(f(n)\log n)$?
Is A more faster than B, for all $n>n_0$ if $g(n)=O(f(n)\log n)$?
Is A more... |
I wonder about cases in which knowing several languages can lead a researcher to interesting results in natural language processing.
For example, knowledge of foreign languages can without doubt contribute to better machine translation, it's the most obvious example.
In what other fields of NLP can a researcher benefi... |
The following question is related to the max cut problem in cubic graphs. In this survey paper Theorem 6.5 states
A maximal cut of a cubic graph can be computed in polynomial time
Browsing through some other related results (for example this SODA paper) one gets the impression that this problem is actually NP complet... |
I'm interested in a slight variant of tiling, the 'jigsaw' puzzle: each edge of a (square) tile is labeled with a symbol from $\{1\ldots n, \bar{1}\ldots\bar{n}\}$, and two tiles can be placed adjacent to each other iff the symbol on one tile's facing edge is $k$ and the symbol on the other tile's facing edge is $\bar{... |
For example, I've a chromosome with 10 genes, the first 5 genes represent a specific property of phenotype and the last 5 genes represent another property of phenotype.
So, I need a crossover operator that performs the cross considering this configuration, where the parent1's first 5 genes are cross with parent2's firs... |
Given a whole number N..
Arrange 1 to N in a sequence such that no two numbers have their average sitting between them...
Note -
If N=20.. average of 19 and 2 = 10.5 is not a whole number .. hence we do not need to worry about such numbers and their averages..
In other words, if average of two numbers is not a whole ... |
I am new to this and an amateur... please help.
My Question in practical terms:
Given The three following inputs... determine the number of unique group arrangements as an ordered set.
INPUT:
'a' = Students
'b' = Groups
'c' = students per group
OUPUT ANSWER:
'z' as an integer
OUTPUT RULES:
- All elements considered ar... |
What is the difference between encoding and modulation?
I have seen these terms used sometimes inter-changeably and sometimes differently (the ratio is 50:50).
Can somebody clearly explain this with some non-technical and technical examples both? I have searched this a lot on net and in the end I end up scratching my h... |
Please suggest some books on Parallel Algorithms which teach efficient programming techniques like the ones taught in Udacity course(Introduction to Parallel Programming with CUDA). Also wanted to know that from which reference book or papers are the concepts in the udacity course on Parallel Computing taught...? I wis... |
I am building a classifier for short texts in a chat system. My features are words and pairs of words.
Naturally, the sentences contain spelling mistakes. If a particular wrong spelling of a certain word hasn't appeared in the training corpus, the classifier has no chance to identify it.
I consider taking an existing s... |
I have been studying the book Introduction to Computation by Michael Sipser on my own, and I'm stuck on this exercise from the chapter on Pushdown Automato and Context-Free Languages. The exercise is to show that $$A=\{x\#y\,|\, x \neq y\}$$ is a context-free language.
I'm having a hard time proving this because of t... |
I have started reading about Decision Support Systems which according to wikipedia is "a computer-based information system that supports business or organizational decision-making activities".
I have seen papers suggesting intelligent decision support systems, does that means a DSS necessarily utilizes Machine Learning... |
I'm trying to find an algorithm to solve the seating chart problem. The goal is to place pepole at one (or multiple) tables such that the overall happiness is maximized.
Each seat has neighbors. A person on a seat can talk to persons on neighboring seats (note that these neighbors normally sit next to each other or on ... |
I need to keep a collection on integers in the range 0 to 65535 so that I can quickly do the following:
Insert a new integer
Insert a range of contiguous integers
Remove an integer
Remove all integers below an integer
Test if an integer is present
My data has the property that it often contains runs of integers in th... |
One possible motivation for studying computational complexity classes is to understand the power of different kinds of computational resources (randomness, non-determinism, quantum effects, etc.). If we look at it from this perspective, then it seems like we can obtain one plausible axiom for any attempt at characteri... |
Why are neural networks initial weights initialized as random numbers?
I had read somewhere that this is done to "break the symmetry" and this makes the neural network learn faster.
How does breaking the symmetry make it learn faster?
Would'nt initializing the weights to 0 be a better idea? That way the weights would b... |
In his lecture Reflections on Trusting Trust, Ken Thompson describes a virus that infects a compiler; the infected compiler installs backdoors into programs, but the key part is that the infected compiler also infects all compilers it compiles.
K. Thompson notes that if this was implemented at the Microcode level, it w... |
The decision problem
Given a Boolean formula $\phi$, does $\phi$ have exactly one satisfying assignment?
can be seen to be in $\Delta_2$, $\mathsf{UP}$-hard and $\mathsf{coNP}$-hard. Is anything more known about its complexity?
|
Having:
$\qquad \begin{align}
S &\to aT \\
T &\to a \mid UTV \\
U &\to ab \mid ba \\
V &\to ac \mid ca
\end{align}$
What language would be generated by this?
How can I obtain an $LL(1)$ grammar using factorisation?
I've tried a number of combinations but do not get how to represent the UTV part:
Someth... |
What is the term for an algorithm that always requests the same sequence of pages? I recall seeing this concept before but haven't been able to find anything on Google without more specific vocabulary.
One algorithm in this category is a linear scan to (say) find the minimum of a set of data. Each page is accessed in... |
I have just used a function 'rand()' in my algorithm. In fact, it was arc4random() that I used. However, it got me thinking, how is randomness created in a computer system?
Can anything ever truly be random when it is produced by a computer?
|
If you have two computers with only one thread, a and b.
And computer a runs twice as fast as computer b.
Does this mean that computer a and can do twice as many operations in a given time in comparison to computer b?
To increase the Hertz of a computer, i.e. the speed of the computer and the number of operations it c... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.