Search Results

Search found 19742 results on 790 pages for 'search tree'.

Page 108/790 | < Previous Page | 104 105 106 107 108 109 110 111 112 113 114 115  | Next Page >

• part of google search appliance drawing from http instead of https

  - by mcgyver5

  we are using the google search appliance in our web app. It is used by several other parts of our organization but we are using it on a web app that uses https. So, we followed google's instructions to get all the google code via https so that users don't get the annoying "This page contains both secure and insecure items" popup. Most of the google code has behaved and come to us as https, but there is a part of it pulling from http://www.google.com/cse full URL = http://www.google.com/cse?q=searchTerma&cx=001025153263958516519%3Aj2323tveixc&cof=FORID%3A11%3BNB%3A1&ie... that causes the insecure items warning to popup. This popup occurs in the results page and the above URL is the only non-secure request I can find.

  Read the article

• Mix2010: Search Engine Optimization (SEO) for Microsoft Silverlight

  I had a great time today in my Mix2010 session on SEO for Silverlight.   You can find all the slides (more than I was able to cover in the talk) here.  and the the full play-by-play of the demo (include a link to the completed solution).    I started off talking why SEO matters Then I talked about three tips   You can view the site live by using Bing for my foodie Explorer Cooking Class with Joe.. or the other guys search engine equally well. ...Did you know that DotNetSlackers also publishes .net articles written by top known .net Authors? We already have over 80 articles in several categories including Silverlight. Take a look: here.

  Read the article

• How to make content display on their proper pages on search engines

  - by Dendory

  So my site has a blog and gallery, both working the same way. There's an index, and each post has a permalink going to the individual entry. However, if I search for some of the content on Google, often it returns a link to the index, just because it happened to have been on the first page when it was crawled, instead of the individual post pages. This is especially true in cases of images. How can I make it so that Google returns the proper pages for the posts instead of just the main page of my site? My whole site is custom php code I made.

  Read the article

• Search for a specific info on pages

  - by Alexis

  I am currently working on a challenge; basically using google api; I would search for facebook fan pages; most specifically the "about" timeline for the email add and the date the business was founded. So far I have come to this: site:facebook.com/pages + "business type" + "country" + "@email.com" I need to add something else so that it can give me back the date it was founded in. If you see the facebook fan page in the about section; there is for e.g (Founded 06/02/2010) The bracketed info above is what I need to add to succeed in adding to the string above; any idea?

  Read the article

• Working on the search

  The one thing I've always like working on and about this site, is the full text search engine and spider. Bascially it goes out and spiders all the major development blogs on the web, and then indexes them. The engine uses Lucene for it's index. Lucene is another open source project and it works really fast. Currently the directory is indexed, and the rss feeds are underway. We're talking about a lot of content, but once it's done you'll be able to pull podcasts, and videos as they get posted to...Did you know that DotNetSlackers also publishes .net articles written by top known .net Authors? We already have over 80 articles in several categories including Silverlight. Take a look: here.

  Read the article

• Formatting Google Search Result [closed]

  - by user5775

  Possible Duplicate: What are the most important things I need to do to encourage Google Sitelinks? Hello, I am new to search engine optimization. I am working on customizing how my results appear in Google as best as possible. I have learned about the meta tags to customize the text summary. However, I have some hierarchical parts to my website. When a result appears related to the "tip-of-the-iceberg", I would like to show links related to the "child" pages. For instance, if you Google "Walmart" you will see the following links listed with the result: Electronics TV & Video Departments Furniture Toys Girls Living Room Computers Is there any way that I can help Google determine which links to show and the text to display for these child links on my site? Or is this something that Google automatically generates? thanks!

  Read the article

• Google60 Emulates Search Engine Querying with 1960s Technology

  - by Jason Fitzpatrick

  Google60 is a novel little project that mimics the interface of a 1960s-era computer and mashes it up with modern Google search queries. Take it for a spin; you’ll never appreciate the speed of even the slowest modern browser more. While playing with the actual project is enjoyable, make sure to check out the project notes below the interface for an interesting look at design choices and emulating an old machine. Google60 [via Unpluggd] Secure Yourself by Using Two-Step Verification on These 16 Web Services How to Fix a Stuck Pixel on an LCD Monitor How to Factory Reset Your Android Phone or Tablet When It Won’t Boot

  Read the article

• How to manually list set of urls for search engines to index

  - by MarutiB

  So I have created a video website which has thousands of videos and thousands of videos get added to it on a daily basis. Here is my problem :- I have created a website which basically loads the skeleton in html and puts all the content through javascript and Ajax. The problem is search engines aren't going anywhere except for the home page. Is there a way say in robots.txt where i give a link to a single html which has links to all these videos ? I agree my site is not accessible for a non-javascript user but stats show that this ratio is very low ( 0.2 % ). Is there a way I can still keep the complete AJAX website and still get each individual videos listed on google ?

  Read the article

• Search Engine Optimisation & Website Design - The Reasons and Rewards of Starting Your Own Business

  The story of starting a web design company in 2010. Written as encouragement for anyone thinking of starting their own business, whether a web design company or any other business for that matter. The telling of this web design company development will include tips, pointers, advice, experiences, do's and don'ts but most importantly will give inspiration and hope to anyone thinking of going it alone, and wandering where to begin. This article will take you through the various stages of development from that initial idea to where we are now with a successful, expanding business offering Search Engine Optimisation, Website Design, Graphic Design and Client Management Systems.

  Read the article

• How to improve a single-paged site search result [closed]

  - by Trisism

  Possible Duplicate: How to SEO a Single-Page website I created an online CV of mine a couple of weeks ago and it has had quite a few visits. Now I want to improve the chance it will appear in google search results; however, my web CV is a one-paged site and it contains only internal links (those with hash #) so I can't really submit a sitemap. I could have changed the internal links to normal links to be processed on server-side, but there's no point of doing so. I'm very new to web SEO so I would really appreciate if somebody can show me what should I do with a single-paged site with internal links to be effectively indexed by crawlers.

  Read the article

• Where is the source of domain search? [closed]

  - by All

  There are several websites providing service of searching for free domains (websites, not registrars). I wonder where is the source of these searches? This search cannot be based on local database, as it needs live data (of available domains). The only possible way (to me) is to fetch every query from the original NIC (e.g. nic.com), but I was unable to find an API for this service. How to find a source to write a script for domain searching?

  Read the article

• Decision Tree code golf

  - by Chris Jester-Young

  In Google Code Jam 2009, Round 1B, there is a problem called Decision Tree that lent itself to rather creative solutions. Post your shortest solution; I'll update the Accepted Answer to the current shortest entry on a semi-frequent basis, assuming you didn't just create a new language just to solve this problem. :-P Current rankings: 107 Perl 121 PostScript (binary) 136 Ruby 154 Arc 160 PostScript (ASCII85) 170 PostScript 192 Python 199 Common Lisp 214 LilyPond 222 JavaScript 273 Scheme 280 R 312 Haskell 314 PHP 339 m4 346 C 406 Fortran 462 Java 476 Java (well, kind of) 718 OCaml 759 F# 1741 sed C++ not qualified for now

  Read the article

• Finding the maximum number of child nodes in a tree

  - by Jiminizer

  First, I should make it clear that this is required for an academic project. I am trying to find the maximum number of child nodes for any node in a tree, using Common Lisp. My current code is shown below - I'm not 100% on the logic of it, but I feel it should work, however it isn't giving me the required result. (defun breadth (list y) (setf l y) (mapcar #'(lambda (element) (when (listp element) (when (> (breadth element (length element)) l) (setf l (breadth element (length element))) ))) list) l) (defun max-breadth(list) (breadth list (length list)) ) As an example, running (max-breadth '(a ( (b (c d)) e) (f g (h i) j))) should return 4. Does anyone have any ideas where I'm going wrong? I suspect it's related to the second conditional, but I'm not sure.

  Read the article

• Subsume external library into source tree with Autotools.

  - by troutwine

  I am developing a new project, using Autotools for my build infrastructure. I would like to subsume external dependencies into my source tree. These dependencies are using Autotools, as well. How can I configure my project's build scripts to build and link against subsumed dependencies? Though Duret-Lutz's tutorial is excellent, this situation is only briefly addressed in a few slides. I found his explanation deeply confusing. By adding the directory name of subsumed dependencies to the toplevel Makefile.am's SUBDIRS the dependency is being configured and built. It is possible to manually set include paths through CFLAGS, but how do I link against libtool .la files?

  Read the article

• Question About MP4(AAC) Binary Tree

  - by DeanMc

  I'm in the very early stages of working on a tag editor for mp4 files and more specifically iTunes AAC ones. After doing some snooping around it seems that the file's structure is not as complicated as I first thought and is built in a sort of tree like the following 4 Bytes [Atom Length] 4 Bytes [Atom Name] X Bytes [Atom Data] An atom's data is as large as the length and can contain either Data(information) or another atom. What I am trying to work out is how one determines if the data is information or an actual atom. Any insight would be much appreciated.

  Read the article

• Sorting tree with a materialized path?

  - by Ovid

  I have a tree structure in a table and it uses materialized paths to allow me to find children quickly. However, I also need to sort the results depth-first, as one would expect with threaded forum replies. id | parent_id | matpath | created ----+-----------+---------+---------------------------- 2 | 1 | 1 | 2010-05-08 15:18:37.987544 3 | 1 | 1 | 2010-05-08 17:38:14.125377 4 | 1 | 1 | 2010-05-08 17:38:57.26743 5 | 1 | 1 | 2010-05-08 17:43:28.211708 7 | 1 | 1 | 2010-05-08 18:18:11.849735 6 | 2 | 1.2 | 2010-05-08 17:50:43.288759 9 | 5 | 1.5 | 2010-05-09 14:02:43.818646 8 | 6 | 1.2.6 | 2010-05-09 14:01:17.632695 So the final results should actually be sorted like this: id | parent_id | matpath | created ----+-----------+---------+---------------------------- 2 | 1 | 1 | 2010-05-08 15:18:37.987544 6 | 2 | 1.2 | 2010-05-08 17:50:43.288759 8 | 6 | 1.2.6 | 2010-05-09 14:01:17.632695 3 | 1 | 1 | 2010-05-08 17:38:14.125377 4 | 1 | 1 | 2010-05-08 17:38:57.26743 5 | 1 | 1 | 2010-05-08 17:43:28.211708 9 | 5 | 1.5 | 2010-05-09 14:02:43.818646 7 | 1 | 1 | 2010-05-08 18:18:11.849735 How would I work that out? Can I do that in straight SQL (this is PostgreSQL 8.4) or should additional information be added to this table?

  Read the article

• Adjacency List Tree Using Recursive WITH (Postgres 8.4) instead of Nested Set

  - by Koobz

  I'm looking for a Django tree library and doing my best to avoid Nested Sets (they're a nightmare to maintain). The cons of the adjacency list model have always been an inability to fetch descendants without resorting to multiple queries. The WITH clause in Postgres seems like a solid solution to this problem. Has anyone seen any performance reports regarding WITH vs. Nested Set? I assume the Nested set will still be faster but as long as they're in the same complexity class, I could swallow a 2x performance discrepancy. Django-Treebeard interests me. Does anyone know if they've implemented the WITH clause when running under Postgres? Has anyone here made the switch away from Nested Sets in light of the WITH clause?

  Read the article

• easiest way to convert virtualbox snapshots to tree view

  - by amir beygi

  HI all My virtual box snapshot view is like this Name: Snapshot 2 (UUID: cb45aef4-54d4-4c4e-ad3e-dd7cccb6103a) Name: s131 (UUID: 8ec30c82-7796-4e51-8161-979f1b95fb0f) Name: s131 (UUID: 42066f33-969b-41f3-a779-7f6e2c45ea2c) Name: s131 (UUID: d71b9bc5-b862-46b5-ae4d-f88d3dd9756d) Name: s131 (UUID: 681896a9-7e61-4b5a-90bc-cb1bd785c6fc) Name: s131 (UUID: d7bf8593-d218-442d-b23b-4ee16e74087d) Name: s131 (UUID: e8b16fd2-7add-4294-b908-34c4e6dc79dc) Name: s131 (UUID: 57c3f5d7-d4ed-4a62-a7b8-5594f819e08e) Name: Snapshot 3 (UUID: 4a684149-9dd6-4bb2-baf5-5f590e91a344) Name: Snapshot 4 (UUID: d4cbaa7c-ae78-41e0-9962-46c587a9c667) Name: Snapshot 5 (UUID: 81567b6e-eea9-49a6-b3b8-a07f0be337d8) * and i want to convert this text to a tree like this Name: Snapshot 2 (UUID: cb45aef4-54d4-4c4e-ad3e-dd7cccb6103a) +--Name: s131 (UUID: 8ec30c82-7796-4e51-8161-979f1b95fb0f) +--Name: s131 (UUID: 42066f33-969b-41f3-a779-7f6e2c45ea2c) +--Name: s131 (UUID: d71b9bc5-b862-46b5-ae4d-f88d3dd9756d) +--Name: s131 (UUID: 681896a9-7e61-4b5a-90bc-cb1bd785c6fc) | +--Name: s131 (UUID: d7bf8593-d218-442d-b23b-4ee16e74087d) | +--Name: s131 (UUID: e8b16fd2-7add-4294-b908-34c4e6dc79dc) | +--Name: s131 (UUID: 57c3f5d7-d4ed-4a62-a7b8-5594f819e08e) +--Name: Snapshot 3 (UUID: 4a684149-9dd6-4bb2-baf5-5f590e91a344) +--Name: Snapshot 4 (UUID: d4cbaa7c-ae78-41e0-9962-46c587a9c667) +--Name: Snapshot 5 (UUID: 81567b6e-eea9-49a6-b3b8-a07f0be337d8) * or even an array that contents line number and parent's line number. My environment is linux, programming language is C, and i got this results from this shell command VBoxManage snapshot s2000 showvminfo s|grep Name|grep UUID

  Read the article

• Experience/Articles about "decision tree" documentation?

  - by Philipp Keller

  I'm running an "defect fixing" group (developers do 2 weeks operations, then rotate). I want to build up a documentation "how to deal with problem x" - basically a decision tree: Is the problem in part x of the web site? Yes: Is the problem occurring in all browsers? Yes: ... No: ... No: ... The documentation should be written and extended by the people using it. Do you know of any book/article describing how that is best done, or is there a software (Mac OS X) that helps doing that?

  Read the article

• SQL Loop over a family tree

  - by simon831

  Using SQL server 2008. I have a family tree of animals stored in a table, and want to give some information on how 'genetically diverse' (or not) the offspring is. In SQL how can I produce sensible metrics to show how closely related the parents are? Perhaps some sort of percentage of shared blood, or a number of generations to go back before there is a shared ancestor? AnimalTable Id Name mumId dadId select * from AnimalTable child inner join AnimalTable mum on child.[mumId] = mum.[Id] inner join AnimalTable dad on child.[dadId] = dad.[Id] inner join AnimalTable mums_mum on mum.[mumId] = mums_mum.[Id] inner join AnimalTable mums_dad on mum.[dadId] = mums_dad.[Id] inner join AnimalTable dads_mum on dad.[mumId] = dads_mum.[Id] inner join AnimalTable dads_dad on dad.[dadId] = dads_dad.[Id]

  Read the article

• Algorithm to aggregate values from child tree nodes

  - by user222164

  I have objects in a tree structure, I would like to aggregate status information from children nodes and update parent node with aggregated status. Lets say node A has children B1, B2, and B1 has C1, C2, C3 as children. Each of the nodes have a status attribute. Now if C1, C2, C3 are all complete then I would like to mark B1 as completed. And if C4, C5,C6,C7 are complete make B2 as complete. When B1 and B2 are both complete mark A as complete. I can go through these nodes in brute force method and make updates, could someone suggest an efficient algorithm to do it. A { B1 { C1, C2, C3}, B2 { C4, C5, C6, C7} }

  Read the article

• Subversion merging, tree merge

  - by krystan honour

  I need to merge changes from a branch back into trunk but want to continue work on the existing branch. I was going to use a re-integrate merge but realised this is not suitable as I will need to recreate my branch etc which for a variety of reasons is not desirable. What I really want to do is merge the current revisions in the branch down to head and then keep people working on their current working copies. So my question is , can tree merge be used to solve this or do I have to reintegrate and recreate.

  Read the article

• Binary Search Tree node removal

  - by doc

  I've been trying to implement a delete function for a Binary Search Tree but haven't been able to get it to work in all cases. This is my latest attempt: if(t->get_left() == empty) *t = *t->get_left(); else if(t->get_right() == empty) *t = *t->get_right(); else if((t->get_left() != empty) && (t->get_right() != empty)) { Node* node = new Node(t->get_data(), t->get_parent(), t->get_colour(), t->get_left(), t->get_right()); *t = *node; } t is a node and empty is just a node with nothing in it. I'm just trying to swap the values but I'm getting a runtime error. Any ideas? Thanks

  Read the article

• Finding height in Binary Search Tree

  - by mike

  Hey I was wondering if anybody could help me rework this method to find the height of a binary search tree. So far my code looks like this however the answer im getting is larger than the actual height by 1, but when I remove the +1 from my return statements its less than the actual height by 1? I'm still trying to wrap my head around recursion with these BST any help would be much appreciated. public int findHeight(){ if(this.isEmpty()){ return 0; } else{ TreeNode<T> node = root; return findHeight(node); } } private int findHeight(TreeNode<T> aNode){ int heightLeft = 0; int heightRight = 0; if(aNode.left!=null) heightLeft = findHeight(aNode.left); if(aNode.right!=null) heightRight = findHeight(aNode.right); if(heightLeft > heightRight){ return heightLeft+1; } else{ return heightRight+1; } }

  Read the article

• nHibernate: Query tree nodes where self or ancestor matches condition

  - by Famous Nerd

  I have see a lot of competing theories about hierarchical queries in fluent-nHibernate or even basic nHibernate and how they're a difficult beast. Does anyone have any knowledge of good resources on the subject. I find myself needing to do queries similar to: (using a file system analog) select folderObjects from folders where folder.Permissions includes :myPermissionLevel or [any of my ancestors] includes :myPermissionLevel This is a one to many tree, no node has multiple parents. I'm not sure how to describe this in nHibernate specific terms or, even sql-terms. I've seen the phrase "nested sets" mentioned, is this applicable? I'm not sure. Can anyone offer any advice on approaches to writing this sort of nHibernate query?

  Read the article

< Previous Page | 104 105 106 107 108 109 110 111 112 113 114 115  | Next Page >