What is claimed is:
1. A method of updating contents of a search engine database comprising a plurality of links each associated with a resource, the method comprising:
determining popularity of each of the plurality of links based, at least in part, on the frequency of retrieval of said link by the search engine in response to a search request;
determining whether the popularity of the link exceeds a predetermined popularity threshold; and
updating information associated with the link, provided that the popularity exceeds the popularity threshold.
2. The method of claim 1, wherein determining popularity comprises determining the number of times, during a predefined period of time, that the resource is actually accessed.
3. The method of claim 1, wherein updating information comprises accessing at least a web page file supported by the resource.
4. The method of claim 3, wherein the resource is configured to provide a web site associated with at least one of the plurality of links.
5. The method of claim 3, further comprising communicating with a content server accessed via a computer network.
6. The method of claim 5, wherein the computer network comprises the Internet.
7. The method of claim 1, further comprising determining whether the information associated with the link has changed.
8. The method of claim 1, further comprising determining the age of the link.
9. The method of claim 8, wherein determining the age of the link comprises determining the time difference between the time the link was last updated and the time at which the link is being considered for updating.
10. The method of claim 9, further comprising determining whether the age of the link exceeds a predetermined age threshold.
11. The method of claim 10, wherein updating information is performed provided that the age of the link exceeds the predetermined age threshold.
12. A system for updating contents of a search engine database comprising a plurality of links each associated with a resource, the system comprising:
a first module that is configured to determine the popularity of each of the plurality of links based, at least in part, on the frequency of retrieval of said link by a search engine in response to a search request, and wherein the first module determines whether the popularity of the link exceeds a predetermined popularity threshold; and
a second module, operationally connected to the first module, that is configured to access the search engine database and the resource for updating information associated with the link, provided that the popularity exceeds the popularity threshold.
13. The system of claim 12, wherein at least one of the first module and second module comprises computer instructions executing on a processor.
14. The system of claim 12, further comprising a memory for storing a queue associated with at least one of the plurality of links for updating.
15. The system of claim 12, wherein the first module is configured to determine popularity by determining the number of times, during a predefined period of time, that the resource is actually accessed by a user after the search engine has retrieved the link as a search result in response to a user search request.
16. The system of claim 12, wherein the first module is further configured to determine the age of the link.
17. The system of claim 12 wherein the second module comprises a robot and an indexer software.
18. The system of claim 16, wherein the second module is configured to update the link provided that the age of the link exceeds a predetermined age threshold.
19. The system of claim 12, wherein the resource is configured to provide a web site associated with at least one of the plurality of links.
20. A system for updating contents of a search engine database comprising a plurality of links each associated with a resource, the system comprising:
means for determining popularity of each of the plurality of links based, at least in part, on the frequency of retrieval of said link by the search engine in response to a search request;
means for determining whether the popularity of the link exceeds a predetermined popularity threshold; and
means for updating information associated with the link, wherein updating information is performed if the popularity exceeds the popularity threshold.
21. The system of claim 20, further comprising means for determining the age of the link.
22. The system of claim 21, wherein the updating means update information if the age of the link exceeds a predetermined age threshold.
23. The system of claim 20 wherein the updating means comprises means for accessing at least a web page file supported by the resource.
24. A method of updating contents of a search engine database comprising a plurality of links each associated with a resource, the method comprising:
determining popularity of each of the plurality of links based, at least in part, on the frequency of retrieval of said link by the search engine in response to a search request; and
updating information associated with at least one of the plurality of links, wherein the most popular link among not-yet-updated links of the plurality of links is selected first for updating.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for decoding signals received on M lines, during a frame q of n time slots, comprising the steps of:
for each of said M received signals, forming a set of combination signals from said signals received during said n time slots of said frame q and during n time slots of the immediately previous frame, q\u22121, wherein M, q, and n are integers greater than 1;
applying the M sets of combination signals developed in said step of forming to a minimum distance decoding process to develop a set of complex vectors; and
converting said set of complex vectors to a block of bits.
2. The method of claim 1 where said converting is carried out by multiplying said set of complex vectors by a plurality of preselected symbols.
3. The method of claim 1 wherein said M received signals are received by M antennas.
4. The method of claim 1 where said step of forming computes the dot product (r2q+1,r2q+2)\xb7(r2q\u22121,r2q*) to form one signal of said set of combination signals, and the dot product (r2q+1,r2q+2*)\xb7(r2q,\u2212r2q\u22121*) to form another signal of said set of combination signals where r2q+1 is the signal received in time slot 2q+1, r2q\u22121 is the signal received in time slot 2q\u22121, r2q+2 is the signal received in time slot 2q+2, and r2q is the signal received in time slot 2q.
5. The method of claim 4 where said step of converting performs the calculation
(a3,a4)=A(B)(a1,a2)+B(B)(\u2212a2*,a1*),
where A(B) and B(B) are complex vectors developed by said minimum distance decoding process, a1 and a2 are preselected symbols, and a3 and a4 are computed symbols.
6. The method of claim 5 further comprising a step of converting said computed symbols into said block of bits.