The tag has no wiki summary.

learn more… | top users | synonyms

0
votes
1answer
24 views

How feasible is it for a non-distributed web crawler running on consumer hardware to search the internet? [closed]

I am looking for an automated way to answer the question: what are the URLs on the world wide web that contain at least two strings from a set of strings. So if I have a set of strings {"A", "B" and ...
1
vote
1answer
90 views

Published or widely known failures of Page Rank algorithm [closed]

I use Google a lot for searching articles and publications. Occasionally, I find Google totally misses what I am looking for and I get completely unexpected results for some search queries. What ...
0
votes
2answers
218 views

Randomizd String Searching [closed]

I need to detect whether a binary pattern P of length m occurs in a binary text T of length n where m I want to state an algorithm that runs in time O(n) where we assume that arithmetic operations on ...
0
votes
0answers
39 views

Search space complexity of directional semantic network

How can I compute the search space complexity of a directional semantic network (i.e. a network where each semantics consist of two nodes and a directional link stands for their semantic relation)? ...
4
votes
1answer
10k views

Complexities of basic operations of searching and sorting algorithms [closed]

Wiki has a good cheat sheet, but however it does not involve no. of comparisons or swaps. (though no. of swaps is usually decides its complexity). So I created the following. Is the following info is ...
2
votes
0answers
96 views

What limits the implementation of proximity operators for text indexing and searching?

I was asking on academia.se, if anyone knows scientific search engines offering a proximity operator like Google Web Search does, while Google Scholar Search does not. That's sad, because this ...
3
votes
2answers
378 views

Bloom Filter for 208 million URLs

I need to create a bloom filter of 208 million URLs. What would be a good choice of bit vector size and number of hash functions? I tried a bit vector of size 1 GB and 4 hash functions, but it ...
3
votes
1answer
114 views

Randomized String Searching

I need to detect whether a binary pattern $P$ of length $m$ occurs in a binary text $T$ of length $n$ where $m < n$. I want to state an algorithm that runs in time $O(n)$ where we assume that ...
7
votes
1answer
1k views

Connection between KMP prefix function and string matching automaton

Let $A_P = (Q,\Sigma,\delta,0,\{m\})$ the string matching automaton for pattern $P \in \Sigma^m$, that is $Q = \{0,1,\dots,m\}$ $\delta(q,a) = \sigma_P(P_{0,q}\cdot a)$ for all $q\in Q$ and $a\in ...