All Questions

41,969 questions
Filter by
Sorted by
Tagged with
5 views

Are 4th generation languages outdated for web applications?

I've recently been programming a website using Java + Spring..... And I see a trend has worsened: annotations & generics. Basically a new layer has been added to java for generating code. Like the ...
4 views

Postponed sieve algorithm with start logic

Based on the answer by Will Ness, I've been using a JavaScript adaptation for the postponed sieve algorithm: ...
6 views

Using B+Tree to implement index, when the index-key size and the data-block size are of the same order

I want to implement an Index using a B+Tree as the underlying data structure. The index will have to support key sizes which are of order of my block size, what means I cannot save all the key as a ...
9 views

Why modulo-2 arithmetic over n-bits doesn't produce single bit result?

I was studying CRC and came across modulo 2 arithmetic. When we add two 1 bit numbers like 1 + 1, 0 + 1, then the result is summation modulo 2 which is similar to XORing of the two bits. My doubt is ...
5 views

Problem with Bayesian Optimization for SVM's hyperparameters

I'm trying a few hyperparameter optimization methods for SMV. Random search manages to usually get pretty good hyperparameters with 0.95+ accuracy. However Bayesian Optimization gets ~0.5 because in ...
11 views

From products of sums to sums of products

Polynomials are usually written as a sum of powers (or various products of generators) and Google gives me lots of results how to get from that to the form that is a product of pure sums (the one ...
8 views

Where is the bottleneck of CompuBERT?

This question is about CompuBERT (new implementation). The average query time is less than 10 seconds. If I had made a good search on google PROBABLY the embedding phase takes 1 second and 0,1 second ...
2 views

Explain better the training mechanism of CompuBERT

This question is about CompuBERT (new implementation). If I have a question with an answer with no common words or mathematical notation, how CompuBERT will behave in this situation? Reasons why I am ...
4 views

Does CompuBERT suffer from de curse of dimensionality?

This question is about CompuBERT (new implementation). I have read textual data have high dimensionality so I would like to know the behaviour of CompuBERT which uses a dot product for question ...
5 views

Is Multiple Negatives Ranking Loss currently the best loss for question answering in CompuBERT?

This question is about CompuBERT (new implementation). (The multiple questions are closely related so don't close my question) Is Multiple Negatives Ranking Loss currently the best loss for question ...
9 views

Frequency of electric impulses from keyboard input into computer? [closed]

What is the frequency of binary code (example on graph :1010101) from keyboard input for computer to read? Is there a specific computer frequency that is high or can I just use low frequency to input ...
12 views

Space-Efficient Online Computation of Quantile Summaries Lemma 3

I am reading the paper Space-Efficient Online Computation of Quantile Summaries and get really stuck trying to understand Lemma 3 onwards. I am sorry it sounds like a lot of questions - this just ...
17 views

A question about the paper "Ensembling Ten Math Information Retrieval Systems"

My question is about the paper Ensembling Ten Math Information Retrieval Systems. I am interested in the task of finding answers. Which of the ten system are able to answer questions using only dot ...
7 views

Can we combine two non-terminals and use this as one non-terminal in CFG?

Let's consider this CFG- S->AB [Here, **S** is the starting variable] A->C CB->Cb C->a Now, the question is- Check if ab is a valid string for the ...
14 views

Is there a best algorithm for Nearest Neighbor Search in Hamming spaces?

I need an algorithm to solve the EXACT Nearest Neighbor problem (I also googled for the keywords "similarity search in binary strings" trying to find better solutions but I couldn't find a ...
18 views

Suppose f(n) is O(h(n)) and g(n) is O(h(n)). Is f(n) * g(n) is O(h(n) * h(n))

I understand this should be a relatively easy proof, but I can't seem to understand how to do it. I know that, by Big O definition: There exists some value C1 where f(n) <= C1 * h(n) for all N >=...
33 views

Is it possible to write a program that is able to recognize some source-code as being its own source code?

Is it possible to write a program that is able to recognize some source code as being its own source-code? Biological organisms evolved the ability of kin-recognition, and later, self-recognition, ...
22 views

Do number of registers and width of register have to be the same?

I am studying Computer Architecture with MIPS-32. The example system has 32 registers with each register having a width of 32 bit. If I would want 128 registers instead of 32 registers, would I have ...
42 views

Solve $T (n) = T (\frac n2) + n(2 - \cos n)$

For the following recurrence relation: $$T (n) = T (n/2) + n(2 - \cos n)$$ I see it based on values of $\cos$ function given that it output values in range, but this does not seem to have anything to ...
48 views

What is the the greatest thing a computer has trouble doing?

If we have all these optimized programs for very specific tasks, what would be the antithesis of them? I've asked a programmer friend of mine, and they thought a good answer had to do with multi-...
21 views

What are the similarities between object oriented and functional programming? [closed]

Are constructs of functional programming and object oriented programming analogous? I read some similarities between Haskell constructs and Java interfaces.
I know this is an amateur question but is it true to say that for any three nonempty languages $L_{1},L_{2},L_{3}$ over an alphabet $\Sigma$ we have $L_{1}(L_{2} \cap L_{3}) = L_{1}L_{2} \cap L_{1}L_{... 1answer 15 views How is it possible that for infinite L in R exists subset L' which is not in Re? Proove that for every infinite$L \in R$there is a$L' \subseteq L$s.t$L' \notin RE$. How can I proove it? if sketched on venn diagram it doesn't make sense... From my point of view everything ... 1answer 18 views What is the difference between FLOPS and OPS? I have typically heard computer performance discussed in terms of FLOPS. However, I have recently seen multiple references instead using OPS i.e. operations per second, typically in the context of Big ... 1answer 21 views hash-tables - Expected-time for an unsuccessful search The following question is from MIT-OCW 6.006, Spring-2008, Problem-Set 2, Q-3.c. Suppose you have a hash table where the load-factor$\alpha$is related to the number$n$of elements in the table by ... 0answers 31 views How many percentage of total transistors in a CPU are used in each component? I'm learning the basics of computers, and now trying to get some oversight of complexity of a CPU. Is there a rough trend for how transistors are allocated in a CPU? Intel 8008 for example, has 3500 ... 0answers 42 views Why can't I break out of this do while loop in java? Even though the input I type is a "Y" or "N" string, I can't break out if this while loop. Can anyone tell me why? ... 2answers 119 views Complexity of a variant of Subset Sum problem This is the variant of SSP: Given$n$positive integer points$a_1, \ldots, a_n$which are all at most$n$, does there exist a subset$\{a_i\}_{i \in P}$, such that its summation is exactly$n+1$? My ... 0answers 16 views Does what I need exist? I want a switch ethernet but I can't find one that fits my needs I want a switch ethernet where I can connect an ethernet that's connected to my router and then have all ethernets ports for my TV, PC... But all I find are ethernet switches that have to be connected ... 1answer 50 views Find neighbour objects in a 3d grid I have points in a 3d world where their position is defined by 3 integers: X, Y, Z. I'm searching for an algorithm / data structure to store these points in a way I can quickly find (e.g.: O(log(N)) ... 0answers 10 views why application consumes space called AppData in C drive unless I download it in E drive? [closed] I'm using windows 10, nowadays I downloaded Unity Hub (E:\unity download\Unity Hub) and editor(E:\unity download\2020.3.17f1) in E drive to do some project, however, I found it still create folder in ... 0answers 10 views Supervised NN not learning [closed] I wanted to create a supervised NN that recognises numbers on images from scratch, pretty ambitious project for someone like me. But when I test it with a simple XOr gate, it completely fails. It just ... 0answers 29 views Kolmogorov complexity of probability distributions, with and without time bound Kolmogorov complexity of a string is the length of the shortest algorithm that generates it. Here I'm focusing instead on randomly distributed strings$x$, with length$n$, with a probability ... 1answer 38 views Why is this greedy strategy always correct for this problem? I'm trying to solve the following problem: https://cses.fi/problemset/task/1084/ My first idea to solve this was to sort the applicants and apartments in increasing order. Then, I iterate through all ... 0answers 34 views How a processor scales in terms of components I'm still very early in understanding some computer science basics. I find it easiest to learn things when I have some oversight of what I can expect. Is there any trend to the number of logical gates ... 1answer 31 views Similarity measures for (geometric) triangulations In a project I am working on, we are looking at multiple different (optimal with respect to some cost measure) triangulations of a fixed pointset$S$. I would like to cluster similar triangulations. ... 1answer 32 views How many functions require precisely$n^2$gates? I'm trying to determine an asymptotic bound on the cardinality of the following set of functions. It is the functions with$n$-bit inputs,$\{0,1\}$output, and requires precisely$n^2$NAND gates. I'... 1answer 23 views Optimal set of shortest paths from one node to all others in a network graph Let's say I have a country with a set of cities, which I represent on the network graph below as a set of nodes. Furthermore, the weighed edge between pairs of nodes, represent the distance by road ... 1answer 242 views What is the difference between Euler and Eulerian graph? A Graph is Eulerian iff$\exists$an Eulerian Cycle or all the vertices of Graph have even degree. What is an Euler graph? Wiki has a definition for the Eulerian graph but not for the Euler graph. 1answer 21 views Do graphs with a bounded number of incident edges have a polynomial-time subgraph-isomorphism algorithm? It is well known that the subgraph isomorphism problem is NP-complete. And so a polynomial-time algorithm for solving it would mean P = NP. Thus I'm interested in whether a bounded version of the ... 1answer 30 views How does primitive recursion handle mutual recursion? My intuition is that you can't call a function that has not yet been defined, although I have yet to find a source confirming this. Is this true? Thanks, friends :) 0answers 20 views return an array to the main function [closed] Trying to call a function "test" from main(). This takes 3 arguments argc, argv and a pointer function which either turns the string into lower case or upper case. ... 1answer 23 views Counter automata with a bound on the counters? It is widely known that emptiness of counter automata is undecidable since two counters are enough to simulate a Turing machine (see the classic book from Hopcroft and Ullman, for example). However, ... 1answer 48 views I have found an example where regular expression is not closed under concatenation. Where am I wrong?$a^n$is a regular expression.$b^n$is a regular expression. their concatenation is$a^nb^n$which is not a regular expression. 1answer 35 views Comparison sort algorithm Consider the following algorithm: The given items are inserted one by one into a list by performing comparisons like a binary search for the right position. Example: Imagine six elements are already ... 1answer 29 views What does it mean for an integer to belong to the halting problem? I have come across the description of a function$F: \mathbb{N} \to \mathbb{N}$where the function is defined one way for$n \in \mathcal{H}$and another way for$n \notin \mathcal{H}.$In this ... 1answer 18 views Is it possible to use one of the two processors for ML acceleration? I have two processors (two different physical processors) with base frequencies 3.2 Ghz and 4.0 Ghz. I want to ask if there exist a method which I can use to the 3.2 Ghz processor for ML acceleration ... 0answers 11 views Hierarchical exclusion acquisition order In the context of parallel computing, it has been said (quote?) that acquiring exclusive locks in opposite order will eventually lead to deadlock conditions. It has been suggested (source?) that the ... 1answer 30 views How to write a regex for repeated patterns I have an alphabet$\Sigma = \{a,b,\#\}$. I'm trying to write a regex that only accepts strings that have the same pattern before and after the$\#$without using back references. For example,$aab\#...
In this FFT algorithm (as per CLRS), in line number 4, shouldn't the angle be $-2\pi i/n$ and not $+2\pi i/n$? The same algorithm is used in cp-algorithms as well, but in python, ...