instruction stringlengths 0 29.8k ⌀ |
|---|
Consider a [minimax](http://en.wikipedia.org/wiki/Minimax) tree for an adversarial search problem. For example, in this picture (alpha-beta pruning):
![enter image description here][1]
[1]: https://i.stack.imgur.com/NmKIO.jpg
When marking the the tree with $[\min,\max]$ values bottom-up, we first traverse ... |
null |
This figure (which is in fact correct) is used in the explanation of the alpha-beta pruning algorithm on a minimax tree. Alpha-beta pruning is a method used to prune parts of the minimax tree in an adversarial search problem. In the context of a tic-tac-toe game, minimax trees are meant to allow the computer to search ... |
|nlp| |
|algorithms| |
As far as I know, much of the speech recognition software is build using Hidden Markov Models (HMM) where observations are individual sound phonemes, and the states correspond to words (or some partitions of the words).
I don't think the systems take into account grammar or sentence structure in the sense that they... |
I have used the Insertion sort algorithm effectively for this issue (see http://en.wikipedia.org/wiki/Insertion_sort). At one time we had a performance issue with a hash table object, I wrote a new object that used binary search instead that increased performance significantly. To keep the list sorted it would keep tra... |
As mentioned in the comments, you can use Linearity of Expectation.
Sort the $y$: $y_1 \le y_2 \le \dots \le y_n$.
For each $y_i$ consider the expected value of $v_i = E[v_i]$.
Then $E[\sum_{i=1}^{n} v_i] = \sum_{i=1}^{n} E[v_i]$
Now $E[v_i]$ on depends only on $i$.
One straight-forward and naive way to ... |
What use are the minimum values on minimax trees? |
|data-structures|trees|game-theory| |
I have used the [Insertion sort](http://en.wikipedia.org/wiki/Insertion_sort) algorithm effectively for this issue. At one time we had a performance issue with a hash table object, I wrote a new object that used binary search instead that increased performance significantly. To keep the list sorted it would keep track ... |
This problem is taken from [interviewstreet.com][1]
We are given an array of integers $Y=\{y_1,...,y_n\}$ that represents $n$ line segments such that endpoints of segment $i$ are $(i, 0)$ and $(i, y_i)$. Imagine that from the top of each segment a horizontal ray is shot to the left, and this ray stops when it touche... |
|algorithms|probability-theory| |
This figure (which is in fact correct) is used in the explanation of the alpha-beta pruning algorithm on a minimax tree. Alpha-beta pruning is a method used to prune parts of the minimax tree in an adversarial search problem. In the context of a tic-tac-toe game, minimax trees are meant to allow the computer to search ... |
|nlp|computer-science-history| |
|machine-learning|data-mining|evolutionary-computing|computer-science-history| |
As mentioned in the comments, you can use Linearity of Expectation.
Sort the $y$: $y_1 \le y_2 \le \dots \le y_n$.
For each $y_i$ consider the expected value of $v_i = E[v_i]$.
Then $E[\sum_{i=1}^{n} v_i] = \sum_{i=1}^{n} E[v_i]$
Now $E[v_i]$ on depends only on $i$.
One straight-forward and naive way to ... |
As mentioned in the comments, you can use Linearity of Expectation.
Sort the $y$: $y_1 \le y_2 \le \dots \le y_n$.
For each $y_i$ consider the expected value of $v_i = E[v_i]$.
Then $E[\sum_{i=1}^{n} v_i] = \sum_{i=1}^{n} E[v_i]$
One straight-forward and naive way to compute $E[v_i]$ would be first fix a ... |
I am currently working on a solution to a problem whereas (after a bit of research) the usage of a hill climbing, and more specific the usage of the "shotgun hill climbing" algorithm idea seems to be the best fitting, as I have no clue how the best start condition can be found
But there is not a lot of information a... |
How does the idea and procedure of "shotgun hill climbing" differ from normal hill climbing? |
|computability|heuristics| |
There is a pretty good description of the [technology that Vlingo is using for speech rec here][1]. They are using Hierarchical Language Models (HLMs) which does look at the context of words with in an utterance to achieve better accuracy. Alas, after being sued by Nuance for patent infringements, [Vlingo has been acq... |
As guessed, this problem seems to be still open.
The corresponding answer in cstheory: http://cstheory.stackexchange.com/a/10989/126
|
null |
I am currently working on a solution to a problem for which (after a bit of research) the use of a hill climbing, and more specificly a *shotgun* (or *random-restart*) [hill climbing](http://en.wikipedia.org/wiki/Hill_climbing) algorithmic idea seems to be the best fit, as I have no clue how the best start value can be... |
How does shotgun hill climbing differ from normal hill climbing? |
|algorithms|optimization|heuristics| |
In a multicore processor, what happens to the contents of a core's cache (say L1) when a context switch occurs on that cache?
Is the behaviour dependent on the architecture or is it a general behaviour followed by all chip manufacturers? |
What happens to the cache contents on a context swtich? |
|multicore|cache| |
*I agree with the comments; the question is broad and you would most probably get better answers if for example you told us what your problem domain is. I will still try to answer the points in your question.*
> How do you choose your start value?
Usually one starts with a random value. On the other hand if one c... |
{"Voters":[{"Id":39,"DisplayName":"Gilles"},{"Id":92,"DisplayName":"Alex ten Brink"},{"Id":98,"DisplayName":"Raphael"},{"Id":472,"DisplayName":"mrm"},{"Id":69,"DisplayName":"Patrick87"}]} |
null |
Rather than "reading off" you should employ one of several canoncial methods to do this. By far the nicest I have seen is one that expresses the automaton as equation system of (regular) languages which can be solved. It is in particular nice as it seems to yield more concise expressions than other methods.
I wrote ... |
The corresponding cstheory question: http://cstheory.stackexchange.com/questions/10983/optimal-algorithm-for-finding-the-girth-of-a-sparse-graph
where both answers (as of Apr 6 2012) claim it is still open.
|
The cache is typically oblivious to a context switch. Only the sequence of memory addresses accessed determines which cache lines are replaced.
The replacement policy is usually a heuristic dependent on the manufacturer and the particular microarchitecture. The problem is that the heuristic cannot predict the future... |
For a given language $L \subseteq \Sigma^*$, let
$\qquad \displaystyle S_L(z) = \sum\limits_{n \geq 0} |L \cap \Sigma^n|\cdot z^n$
the (ordinary) [generating function](https://en.wikipedia.org/wiki/Generating_function) of $L$, i.e. its sequence of word counts per length.
The following statement holds [[FlSe09]... |
The cache is typically oblivious to a context switch. Only the sequence of memory addresses accessed determines which cache lines are replaced.
The replacement policy is usually a heuristic dependent on the manufacturer and the particular microarchitecture. The problem is that the heuristic cannot predict the future... |
The cache is typically oblivious to a context switch. Only the sequence of memory addresses accessed determines which cache lines are replaced.
The replacement policy is usually a heuristic dependent on the manufacturer and the particular microarchitecture. The problem is that the heuristic cannot predict the future... |
You can get arbitrary difficult problems depending on your $f$.
Let $A$ be a language. Define $f$ as follows:
$$f(x)= \begin{cases} 0 & x\in A \\ 1 & o.w. \\\end{cases}$$
Consider set $S=\{x\}$. There is a non-empty subset $X\subseteq S$ s.t. $f(\Sigma_{x\in X} x) = 0$ iff $x \in A$.
Without putting a comple... |
I am working on an expression based language of ML genealogy, so it naturally needs type inference >:)
Now, I am trying to extend a constraint-based solution to the problem of inferring types, based on a simple implementation in EOPL (Friedman and Wand), but they elegantly side-step algebraic datatypes.
What I ha... |
Constraint-based Type Inference with Algebraic Data |
|programming-languages|type-theory|functional-programming|inductive-datatypes|inference-engine| |
What happens to the cache contents on a context switch? |
|multicore|cache|microarchitecture| |
null |
|computer-architecture|operating-systems|multicore|cache| |
That depends both on the processor (not just the processor series, it can vary from model to model) and the operating systems, but there are general principles. Whether a processor is multicore has no direct impact on this aspect; the same process could be executing on multiple cores simultaneously (if it's multithread... |
|computer-architecture|operating-systems|cpu-cache| |
|natural-language-processing|history| |
|machine-learning|data-mining|evolutionary-computing|history| |
For a given language $L \subseteq \Sigma^*$, let
$\qquad \displaystyle S_L(z) = \sum\limits_{n \geq 0} |L \cap \Sigma^n|\cdot z^n$
the (ordinary) [generating function](https://en.wikipedia.org/wiki/Generating_function) of $L$, i.e. its sequence of word counts per length.
The following statement holds [[FlSe09]... |
|programming-languages|type-theory|functional-programming|inductive-datatypes|typing| |
Methods and techniques for proving theorems |
null |
A computation model in which the computation is described via circuits of various logic gates. |
null |
null |
Just posting a slight elaboration on JeffE's answer.
We know that two functions/cases exist that can compute the function f(n):
1. A function that always returns true (for all n, there exist n number of consecutive 0's)
2. A function that will return true if n is smaller than an integer N, where N is defined as... |
This is my first post here. I am currently a undergraduate student with exposure to software engineer research and thought that this question would be appropriate here instead of stack overflow or others.
I have noticed in my short academic life that many published papers in our area sometimes do not have much rigo... |
How are statistics being applied in computer science to evaluate accuracy in research claims? |
|empirical-research| |
As a graduate student in computer science, who has exposure to research in fields other than computer science, and whose research group works in an area of computer science where statistics can be fruitfully applied, I can offer my experience; your mileage may vary.
In general, even the most well-meaning scientific ... |
As a graduate student in computer science, who has exposure to research in fields other than computer science, and whose research group works in an area of computer science where statistics can be fruitfully applied, I can offer my experience; your mileage may vary.
In general, even the most well-meaning scientific ... |
null |
Pierre Wolper showed that there were omega-regular properties that were not LTL-definable and gave an extension of LTL (called ETL I think) that could express omega-regular properties.
> [Temporal Logic can be more expressive][1], Pierre Wolper, Information and Computation, 1983.
For connections to the linear-tim... |
I don't have enough rep points to comment. So, I am posting an answer.
Software engineering includes many features. Two of them are, human factor and quality measure.
Let’s say I want to do productivity analysis. The data collection would be hard comparing to algorithm analysis because the data is about human pro... |
This is my first post here. I am currently a undergraduate student with exposure to software engineer research and thought that this question would be appropriate here instead of stack overflow or others.
I have noticed in my short academic life that many published papers in our area sometimes do not have much rigo... |
|empirical-research|software-engineering| |
First, some context to the question I am asking.
Different queues:
Job Queue: Each entering process goes into job queue. Processes in job queue reside on mass storage and awaits the allocation of main memory.
Ready Queue: The set of all processes that are in main memory and are waiting for CPU time, are kept i... |
Which queue does the long-term scheduler maintain? |
|operating-systems|scheduling| |
I don't have enough rep points to comment. So, I am posting an answer.
Software engineering includes many features. Two of them are, human factor and quality measure.
Let’s say I want to do productivity analysis. The data collection would be hard comparing to algorithm analysis because the data is about human pro... |
null |
First, some context to the question I am asking.
Different queues:
Job Queue: Each entering process goes into job queue. Processes in job queue reside on mass storage and awaits the allocation of main memory.
Ready Queue: The set of all processes that are in main memory and are waiting for CPU time, are kept i... |
|operating-systems|scheduling|process| |
$E[V]$ is roughly half the expected number of comparisons performed by randomized quicksort.
For any indices $i\le j$, let $X_{ij} = 1$ if $Y_j = \max\{Y_i,...,Y_j\}$ and $X_{ij}=0$ otherwise.
Then for any index $j$, we have $v_j = \sum_{i=1}^j X_{ij}$ (Do you see why?) and therefore
$$
V = \sum_{j=1}^n v_j = \... |
I don't have enough rep points to comment. So, I am posting an answer.
Software engineering includes many features. Two of them are, human factor and quality measure.
Let’s say I want to do productivity analysis. The data collection would be hard comparing to algorithm analysis because the data is about human pro... |
null |
First, some context to the question I am asking.
Different queues:
Job Queue: Each entering process goes into job queue. Processes in job queue reside on mass storage and awaits the allocation of main memory.
Ready Queue: The set of all processes that are in main memory and are waiting for CPU time, are kept i... |
This is an expanded version of my answer from here http://cs.stackexchange.com/questions/1027/using-pumping-lemma-to-prove-language-is-not-regular since this is supposed to be a reference question.
So, you think the pumping lemma looks complicated? Don't worry. Here's a slightly different take approach, which is h... |
I know this is a simple question but can someone show me how
$(\lambda y. \lambda x. \lambda y.y) (\lambda x. \lambda y. y)$ reduces to $\lambda x. \lambda y. y$. |
null |
$E[V]$ is roughly half the expected number of comparisons performed by randomized quicksort.
*The following assumes that sticks have distinct heights $(*)$.*
For any indices $i\le j$, let $X_{ij} = 1$ if $Y_j = \max\{Y_i,...,Y_j\}$ and $X_{ij}=0$ otherwise.
Then for any index $j$, we have $v_j = \sum_{i=1}^j X... |
Questions about genesis and development of computer science as a scientific discipline and its applications. |
null |
This is my first post here. I am currently an undergraduate student with exposure to software engineer research and thought that this question would be appropriate here instead of stack overflow or others.
I have noticed in my short academic life that many published papers in our area sometimes do not have much rig... |
|software-engineering|empirical-research|statistics| |
Expanding on the answer of @Aryabhata:
Fix an $i$, and assume the item $y_i$ is at position $j$. The exact value of the height is immaterial, what matters is whether the items are greater than or equal to $y_i$ or not. Therefore consider the set of items $Z^{(i)}$, where $z_k^{(i)}$ is 1 if $y_k\geq y_i$, and $z_k^... |
As a graduate student in computer science, who has exposure to research in fields other than computer science, and whose research group works in an area of computer science where statistics can be fruitfully applied, I can offer my experience; your mileage may vary.
In general, even the most well-meaning scientific ... |
Expanding on the answer of @Aryabhata:
Fix an $i$, and assume the item $y_i$ is at position $j$. The exact value of the height is immaterial, what matters is whether the items are greater than or equal to $y_i$ or not. Therefore consider the set of items $Z^{(i)}$, where $z_k^{(i)}$ is 1 if $y_k\geq y_i$, and $z_k^... |
null |
|operating-systems|process-scheduling| |
|operating-systems|process-scheduling| |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.