Search Results

Search found 26158 results on 1047 pages for 'google panda algorithm'.

Page 142/1047 | < Previous Page | 138 139 140 141 142 143 144 145 146 147 148 149  | Next Page >

• How long before Google will update search terms matching my website?

  - by Camran

  I have a website which title I changed about a month ago. The website is a classifieds website which is dynamic, using php. The title changed from "Free classifieds" to "buy and sell free classifieds". The strange part is that after about two weeks the title showed in google search results changed to the new title, BUT when I searched for "buy and sell free classifieds" my website didn't show up at all. I mean I have gone through over 30 pages of search results and my site isn't listed. However, searching for "free classifieds" still display my website at the same position it was before the title change. Any reason for this? How patient should I be? FYI the website has a sitemap submitted and updated, good meta tags and is W3 valid etc etc, so that is not the problem here. Thanks

  Read the article

• External link tracking when opening the link in a new window in Google Analytics?

  - by evanmcd

  OK, so this seems like a really simply problem, but I have yet to find a solution that accomplishes the following: Opens the link in a new window Tracks the event in GA (obviously) Doesn't trigger pop-up blockers (uses target="_blank" instead of window.open) Most of the code I've seen, including Google's, doesn't take into account the case of opening in a new window - they just window location.href. Even GAAddons (http://gaaddons.com/), which charges for commercial use, doesn't seem to work for me. Perhaps, I'm missing something simple - I'd be relieved if so and would thank profusely whoever points it out to me! If no one is able to provide an example, I'll post some of the test cases I've created to illustrate the problem. Thanks.

  Read the article

• Les Google Apps veulent se positionner en concurrent de Sharepoint, Gmail passe les 425 millions d'utilisateurs

  Les Google Apps veulent se positionner en concurrent de Sharepoint Gmail passe les 425 millions d'utilisateurs Parmi les nombreux chiffres donnés sur ses différents produits, Google en a mis deux particulièrement en avant : ceux de ses Web Apps et de sa messagerie. Lancée en 2004, la messagerie Gmail possède aujourd'hui 425 millions d'utilisateurs. Un bon résultat. Surtout si on lui ajoute 5 millions de client "business" qui utilisent les Google Apps (en résumé Gmail + Google Docs) comme par exemple la compagnie aérienne européenne KLM. Mais cette annonce a surtout été l'occasion pour Sundar Pichai, vice-président de Google, de s'attaquer à son conc...

  Read the article

• Google Analytics + External Site Statistics Tracking in one application?

  - by Soleil

  My company is a broker in the real estate industry. As such, we send a lot of our listings to sites like Trulia.com and Zillow.com, among others. These sites direct leads to our realtors, and provide us with reports every month detailing the activity our listings have had on their site-- links back to our website, emails generated, etc. Our Marketing and Advertising departments want to take that information and enter it into a system to keep track of everything in one place, for the purpose of producing comparison reports. I cannot find any externally available product that provides this functionality. I would sincerely like to avoid writing this tool myself. Does anyone know of a tool that could do this? In short, an ideal system would: Imports Google Analytics data via API Imports real estate listing site data via CSV import / manual entry Provides comparison reports based on data Does anyone know of anything pre-made that can do this?

  Read the article

• Google Maps : Street View enrichit la WebApp accessible depuis les navigateurs mobiles, première réponse de Google à Apple

  Google Maps : StreetView enrichit la WebApp Accessible depuis les navigateurs mobiles, une première réponse de Google à la décision d'Apple Google vient d'ajouter StreetView à son application Web accessible depuis un navigateur mobile? et donc depuis un iPad ou un iPhone via Safari. Cette WebApp - enrichie de la fonctionnalité qui permet de naviguer virtuellement dans les rues de villes - est aujourd'hui le seul moyen pour Google de toucher les utilisateurs sous iOS depuis qu'Apple a décidé de mettre fin au partenariat qui faisait des Google Maps le service de cartographie par défaut de ses appareils. Pour les remplacer, Apple a sorti sa propre application. Mais son service...

  Read the article

• Les autorités américaines préparent un procès d'envergure contre Google, qui risque également des poursuites en Europe

  Les autorités américaines préparent un procès d'envergure contre Google Qui risque des poursuites des deux côtés de l'Atlantique pour ?comportement préférentiel? Le New York Times a publié un rapport dévoilant que la FTC (Federal Trade Commission) prépare un nouveau procès antitrust contre Google. Le dossier de l'affaire contient un mémo détaillé de plus de 100 pages, qui tente de répondre à la question de savoir si Google manipule ses résultats de recherche afin de favoriser ses services et de désavantager les produits de ses concurrents. [IMG]http://x-plode.developpez.com/images/news/40-fonctionnalites-google/google.jpg[/IMG] L'enquête est tenue par les procureu...

  Read the article

• Search predictions broken in Chrome - reinstall didn't solve the problem

  - by Shimmy

  I recently changed the default search engine to a custom google search URL (using baseUrl) with some additional parameters and removed all the rest of the search engines, and since then, the search predictions stopped working. I even tried to reinstall Chrome but as soon as I resync, the problem is back! Search predictions are just gone without option to fix!! In IE changing the search provider allows specifying a prediction (suggestion) provider, In chrome, once you change the default search engine, you'll never be able to have predictions again!! This is a terrible bug, I mean WTF!!! Is there any workaround to that? I posted a bug report a while ago but it seems no one looks at it. I'm about to give up on Chrome and go back to IE, the only good thing about Chrome is the Extension market and the AdBlocker (which I can find in IE as well). The perfrormance changes don't matter to me too much. Thanks

  Read the article

• Creating/Editing Existing Documents

  - by Caroline Jones

  A document was shared with me, enabling me to edit it. However, whenever I open it, it only lets me view it, and anytime I try to open the "Open with Google Docs" tab, it acts as if I never pressed it, same as if I try to download it. Same with whenever I try to create a new document. I'll click "Create" and then "Document" and it won't be registered. I really need these issues fixed pronto, as I have to use this software every day. Please help!!

  Read the article

• How to improve long text readability in Chrome?

  - by amiregelz

  I need to start reading The TCP/IP Guide. I have to admit that compared to other informative guides/tutorials/articles out there, this guide isn't so cluttered. However, I still find it a little bit hard to read, especially when reading for several hours. I don't know if it's the font, the contrast or the spacing, but this is why I've always preferred learning from books rather than from the internet. What can I do to make this guide more readable? I am reading it on Google Chrome.

  Read the article

• Compute number of occurrences in a column of a spreadsheet

  - by wnstnsmth

  I have a Google Drive spreadsheet with a single column that holds string values (Twitter screen names) such as "user1", "user1", "UserX", and I would like to count those values so that I can easily craft a bar chart out of it. So the result should be value occurrence ----------------------- user1 2 UserX 1 ... .... Please note, I only want to look for whole words, and not part words. EG, the words 'on' and 'one' appears in the word 'money' - I would not count this (eg, only the word money is counted). Hope that is clear enough. What formula should I use?

  Read the article

• Is it possible to get a google voice number without already having a phone number?

  - by boost

  I'm sorry if this is the wrong place to post this, but I couldn't find a more suitable website in the stackexchange network. I currently have no phone number; I can make outgoing calls via the widget in gmail, but I cannot receive calls (as far as I know). I know that you can set up a google voice number to forward to google chat, and this is exactly what I want. The problem is, I can't get a google voice number in the first place, because it first requires that I have an existing phone number, even if I wouldn't use it. So, it is possible to skip providing an existing phone number, and just get a google voice number that forwards to google chat? Alternatively, is there any free phone service that can be used without a phone and lets you receive calls from any number? I realize I'm kind of asking for free candy, but, if it's out there, I'd be a fool

  Read the article

• Does searching a keyword on Google make the crawlers look harder in the future?

  - by Foo Bar

  Do the search requests made by the users influence the Google crawlers "attraction" by this keyword? Let's say Google has some hits on a specific keyword in the search index. And now I search for exactly this keyword. Will the Google crawlers react to the search and keep looking more intense for pages that could match this keyword? A reason why this could be important: Privacy when searching yourself. Assume you just want to know how much Google (and thus other people) can find out about you. If now any (statistical) additional search for your name trigger the crawlers even one step harder to find even more about you, it would have the negative effect that you would actually be found easier in the future, even though you had the intention and hope to find out how few Google finds about you. It's a bit like the dillema in quantum mechanis: Does observing the system automatically change the system?

  Read the article

• Unexpected "waiting for localhost"?

  - by Tenaar

  So I ran into something that kind of worried me today. Lately my computer has been kind of slow and I'm dealing with that, but today when I opened Facebook in Google Chrome, I noticed a message in the bottom left corner while it was loading the site that said "Waiting for localhost". It was brief and I managed to notice it because my computer is slower than it used to & it caused Chrome to hang briefly, long enough for me to read it. As I'm quite confident in that Facebook isn't running on my localhost, I'm wondering what could potentially make Chrome wait for localhost while I'm loading webpages from external servers. Is there a malware of some kind that I should be worrying about? Unfortunately I have no other information than this to go on, and I have no idea how to further investigate this, if it generated any logs or whatever. I'd appreciate any help in figuring out this matter!

  Read the article

• How do we calculate the filters in Mel-Frequency Cepstrum Coefficients Algorithm?

  - by André Ferreira

  After calculating the FFT and with the frequency we need to do something like this: http://instruct1.cit.cornell.edu/courses/ece576/FinalProjects/f2008/pae26%5Fjsc59/pae26%5Fjsc59/images/melfilt.png We filter the frequency spectrum with those triangles. I saw that we can use distint ways to calculcate the triangles. I will make the size of the triangles equal till 1kz and after that obtained with log function. What should we do now? With the frequency spectrum and the triangles defined.. - We should filter the frequency (frequencies limited to the triangles, if goes higher only counts till the triangle limit) and calculate the value of each triangle (and after that continue the algorithm). But when does the mel conversation happens? m = 2595 log (f/700 + 1) When do we pass from frequency to mel.. Can someone guide me in the right direction plz :d

  Read the article

• ideas for algorithm? sorting a list randomly with emphasis on variety

  - by Steve Eisner

  I have a table of items with [ID,ATTR1,ATTR2,ATTR3]. I'd like to select about half of the items, but try to get a random result set that is NOT clustered. In other words, there's a fairly even spread of ATTR1 values, ATTR2 values, and ATTR3 values. This does NOT necessarily represent the data as a whole, in other words, the total table may be generally concentrated on certain attribute values, but I'd like to select a subset with more variety. The attributes are not inter-related, so there's not really a correlation between ATTR1 and ATTR2. Any ideas for an efficient algorithm? Thanks! I don't really even know how to search for this :)

  Read the article

• What algorithm can calculate the power set of a given set?

  - by ross

  I would like to efficiently generate a unique list of combinations of numbers based on a starting list of numbers. example start list = [1,2,3,4,5] but the algorithm should work for [1,2,3...n] result = [1],[2],[3],[4],[5] [1,2],[1,3],[1,4],[1,5] [1,2,3],[1,2,4],[1,2,5] [1,3,4],[1,3,5],[1,4,5] [2,3],[2,4],[2,5] [2,3,4],[2,3,5] [3,4],[3,5] [3,4,5] [4,5] Note. I don't want duplicate combinations, although I could live with them, eg in the above example I don't really need the combination [1,3,2] because it already present as [1,2,3]

  Read the article

• Is Work Stealing always the most appropriate user-level thread scheduling algorithm?

  - by Il-Bhima

  I've been investigating different scheduling algorithms for a thread pool I am implementing. Due to the nature of the problem I am solving I can assume that the tasks being run in parallel are independent and do not spawn any new tasks. The tasks can be of varying sizes. I went immediately for the most popular scheduling algorithm "work stealing" using lock-free deques for the local job queues, and I am relatively happy with this approach. However I'm wondering whether there are any common cases where work-stealing is not the best approach. For this particular problem I have a good estimate of the size of each individual task. Work-stealing does not make use of this information and I'm wondering if there is any scheduler which will give better load-balancing than work-stealing with this information (obviously with the same efficiency). NB. This question ties up with a previous question.

  Read the article

• Algorithm to find a measurement of similarity between lists.

  - by Cubed

  Given that I have two lists that each contain a separate subset of a common superset, is there an algorithm to give me a similarity measurement? Example: A = { John, Mary, Kate, Peter } and B = { Peter, James, Mary, Kate } How similar are these two lists? Note that I do not know all elements of the common superset. Update: I was unclear and I have probably used the word 'set' in a sloppy fashion. My apologies. Clarification: Order is of importance. If identical elements occupy the same position in the list, we have the highest similarity for that element. The similarity decreased the farther apart the identical elements are. The similarity is even lower if the element only exists in one of the lists. I could even add the extra dimension that lower indices are of greater value, so a a[1] == b[1] is worth more than a[9] == b[9], but that is mainly cause I am curious.

  Read the article

• Algorithm to emulate mouse movement as a human does?

  - by Eye of Hell

  Hello I need to test a software that treats some mouse movements as "gestures". For such a task I need to emulate mouse movement from point A to point B, not in straight line, but as a real mouse moves - with curves, a bit of jaggedyness etc. Is there any available solution (algorithm/code itself, not a library/exe) that I can use? Of course I can write some simple sinusoidal math by myself, but this would be a very crude emulation of a human hand leading a mouse. Perhaps such a task has been solved already numerous times, and I can just borrow an existing code? :)

  Read the article

• Algorithm to find the smallest snippet from searching a document?

  - by deliciousirony

  I've been going through Skiena's excellent "The Algorithm Design Manual" and got hung up on one of the exercises. The question is: "Given a search string of three words, find the smallest snippet of the document that contains all three of the search words—i.e. , the snippet with smallest number of words in it. You are given the index positions where these words in occur search strings, such as word1: (1, 4, 5), word2: (4, 9, 10), and word3: (5, 6, 15). Each of the lists are in sorted order, as above." Anything I come up with is O(n^2)... This question is in the "Sorting and Searching" chapter, so I assume there is a simple and clever way to do it. I'm trying something with graphs right now, but that seems like overkill. Ideas? Thanks

  Read the article

• What is an algorithm for minimizing some D distances between N items?

  - by Ross

  A classmate printed out a diagram of a database for class, the kind with lines representing relationships between tables. However, his lines crossed all over the place and it looked ugly. So I got to thinking about a way to move the tables to minimize the total line distance, and I couldn't think of a way to do it, other than just moving them all on top of each other. So basically: Given N items on some 2d coordinate space and some amount of connections between pairs of those items, how do you move the items so that the total distance between pairs is minimal, but that no distance is smaller than S? (so that the tables would not be too close together) Is there some algorithm for this? (I realize that smallest total distance won't necessarily make the layout less ugly; lines might still cross. But the table layout is just what got me thinking)

  Read the article

• Algorithm: Removing as few elements as possible from a set in order to enforce no subsets.

  - by phimuemue

  Hello, I got a problem which I do not know how to solve: I have a set of sets A = {A_1, A_2, ..., A_n} and I have a set B. The target now is to remove as few elements as possible from B (creating B'), such that, after removing the elements for all 1 <= i <= n, A_i is not a subset of B'. For example, if we have A_1 = {1,2}, A_2 = {1,3,4}, A_3={2,5}, and B={1,2,3,4,5}, we could e.g. remove 1 and 2 from B (that would yield B'={3,4,5}, which is not a superset of one of the A_i). Does anybody know an algorithm for determining the (minimal number of) elements to be removed?

  Read the article

• Is there an Objective-C algorithm like `transform` of the C++ STL?

  - by pesche

  My goal is to have an array that contains all filenames of a specific extension, but without the extension. There's an elegant solution to get all filenames of a specific extension using a predicate filter and instructions on how to split a path into filename and extension, but to combine them I would have to write a loop (not terrible, but not elegant either). Is there a way with Objective-C (may be similar to the predicate mechanism) to apply some function to every element of an array and put the results in a second array, like the transform algorithm of the C++ STL does?

  Read the article

• Which parallel sorting algorithm has the best average case performance?

  - by Craig P. Motlin

  Sorting takes O(n log n) in the serial case. If we have O(n) processors we would hope for a linear speedup. O(log n) parallel algorithms exist but they have a very high constant. They also aren't applicable on commodity hardware which doesn't have anywhere near O(n) processors. With p processors, reasonable algorithms should take O(n/p log n/p) time. In the serial case, quick sort has the best runtime complexity on average. A parallel quick sort algorithm is easy to implement (see here and here). However it doesn't perform well since the very first step is to partition the whole collection on a single core. I have found information on many parallel sort algorithms but so far I have not seen anything pointing to a clear winner. I'm looking to sort lists of 1 million to 100 million elements in a JVM language running on 8 to 32 cores.

  Read the article

• Where to find viterbi algorithm transition values for natural language processing?

  - by Rodrigo Salazar

  I just watched a video where they used Viterbi algorithm to determine whether certain words in a sentence are intended to be nouns/verbs/adjs etc, they used transition and emission probabilities, for example the probability of the word 'Time' being used as a verb is known (emission) and the probability of a noun leading onto a verb (transition). http://www.youtube.com/watch?v=O_q82UMtjoM&feature=relmfu (The video) How can I find a good dataset of transition and emission probabilities for this use-case? Or EVEN just a single example with all the probabilities displayed, I want to use realistic numbers in a demonstration.

  Read the article

< Previous Page | 138 139 140 141 142 143 144 145 146 147 148 149  | Next Page >