Search Results

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

Page 62/790 | < Previous Page | 58 59 60 61 62 63 64 65 66 67 68 69  | Next Page >

• 3 SEO Secrets to Skyrocket Your Search Engine Rankings

  How would you like to improve you search engine rankings, and increase traffic and get more sales on your website? The answer lies in "SEO" or "Search Engine Optimization," and webmasters who can effectively SEO tend to rank higher in the search engines.

  Read the article

• Search Engine Optimization Terms

  By the time you complete this multiple lesson tutorial, you'll know just what it takes to score top search engine positions for your Web sites. You'll understand how search engines crawl the Web, how they rank Web sites, and how they find previously undiscovered sites. You'll master the important HTML tags that are your key to getting your sites on a search engine's radar, and you'll see why it's important to amass as many potential keywords as possible.

  Read the article

• How to Check Search Engine Ranking - 2 Methods

  There are four primary traffic routes leading to your website: direct visit, website referral, paid advertisement referral and search engine referral. A search engine referral means that your site came up high enough on the rankings of a search site like Google or Bing for someone to see your site and click on the link.

  Read the article

• What is SEO (Search Engine Optimization)?

  SEO in its most basic form is a series of steps taken to make a web site search engine friendly and have it show up in the search engines. At a more advanced level, SEO can be implemented to allow the web site in question to rank high in the search engines, preferably in the first few positions.

  Read the article

• Pseudo LRU tree algorithm.

  - by patros

  A lot of descriptions of Pseudo LRU algorithms involve using a binary search tree, and setting flags to "point away" from the node you're searching for every time you access the tree. This leads to a reasonable approximation of LRU. However, it seems from the descriptions that all of the nodes deemed LRU would be leaf nodes. Is there a pseudo-LRU algorithm that deals with a static tree that will still perform reasonably well, while determining that non-leaf nodes are suitable LRU candidates?

  Read the article

• Parsing a given binary tree using python?

  - by kaushik

  Parse a binary tree,referring to given set of features,answering decision tree question at each node to decide left child or right child and find the path to leaf node according to answer given to the decision tree.. input wil be a set of feature which wil help in answering the question at each level to choose the left or right half and the output will be the leaf node.. i need help in implementing this can anyone suggest methods?? Please answer... thanks in advance..

  Read the article

• gunit syntax for tree walker with a flat list of nodes

  - by Kaleb Pederson

  Here's a simple gunit test for a portion of my tree grammar which generates a flat list of nodes: objectOption walks objectOption: <<one:"value">> -> (one "value") Although you define a tree in ANTLR's rewrite syntax using a caret (i.e. ^(ROOT child...)), gunit matches trees without the caret, so the above represents a tree and it's not surprising that it fails: it's a flat list of nodes and not a tree. This results in a test failure: 1 failures found: test2 (objectOption walks objectOption, line17) - expected: (one \"value\") actual: one \"value\" Another option which seems intuitive is to leave off the parenthesis, like this: objectOption walks objectOption: <<one:"value">> -> one "value" But gunit doesn't like this syntax. It seems to result in a parse failure in the gunit grammar: line 17:20 no viable alternative at input 'one' line 17:24 missing ':' at 'value' line 0:-1 no viable alternative at input '<EOF>' java.lang.NullPointerException at org.antlr.gunit.OutputTest.getExpected(OutputTest.java:65) at org.antlr.gunit.gUnitExecutor.executeTests(gUnitExecutor.java:245) ... What is the correct way to match a flat tree?

  Read the article

• How to add search.asmx web reference to webpart application in VS2008 ? facing problem.

  - by Lalit

  Hi, I am trying to create the custom search webpart. I want to use Enterprise Search Query Model (MOSS) . But unable to add the web reference of the search.asmx webservice. infact it has no WSDL file. just wondering about what setting it needs.... too If anybody know how to do, same. please let me know. you can find the search webservice at "http://:/sites//_vti_bin/spsearch.asmx" I tried by right cliking on project said Add Service Reference , inserts the url said Go , but nothis was there. same i tried with web aplication . but no effect. even i can see the methods in browser, but cannot generate WSDL ??

  Read the article

• Psuedo LRU tree algorithm.

  - by patros

  A lot of descriptions of Pseudo LRU algorithms involve using a binary search tree, and setting flags to "point away" from the node you're searching for every time you access the tree. This leads to a reasonable approximation of LRU. However, it seems from the descriptions that all of the nodes deemed LRU would be leaf nodes. Is there a pseudo-LRU algorithm that deals with a static tree that will still perform reasonably well, while determining that non-leaf nodes are suitable LRU candidates?

  Read the article

• Output of gcc -fdump-tree-original

  - by Job

  If I dump the code generated by GCC for a virtual destructor (with -fdump-tree-original), I get something like this: ;; Function virtual Foo::~Foo() (null) ;; enabled by -tree-original { <<cleanup_point <<< Unknown tree: expr_stmt (void) (((struct Foo *) this)->_vptr.Foo = &_ZTV3Foo + 8) >>> >>; } <D.20148>:; if ((bool) (__in_chrg & 1)) { <<cleanup_point <<< Unknown tree: expr_stmt operator delete ((void *) this) >>> >>; } My question is: where is the code after "<D.20148>:;" located? It is outside of the destructor so when is this code executed?

  Read the article

• How do I fix the broken Windows 7 Search feature?

  - by jasonh

  I'm trying to search my Windows Home Server for .DS_Store files that my Mac littered the server with. Windows 7 reports there are no *.DS_Store files in a folder, even though I can see it with the Show hidden files and folders option turned on. What can I do to track all these files down on my server and wipe them out?

  Read the article

• Multivariate Decision Tree learner

  - by Snej

  A lot univariate decision tree learner implementations (C4.5 etc) do exist, but does actually someone know multivariate decision tree learner algorithms?

  Read the article

• Is Lucern.net good choice for website search of 1M item product database? (giving up on SQL Server

  - by Pete Alvin

  We currently have in production SQL Server 2005 and we use it's full text search for a eCommerce site search of a million product database. I've optimized it as much as possible (I think) and we're still seeing search times of five seconds. (We don't need site scrawl or PDF (etc.) document indexing features... JUST "Google" speed for site search.) I was going to buy dtSearch but now I realize I can just use Lucerne.net and save the $2,500 for two server license. I read on a post that Lucerne.Net is not good for website searches. Has anyone else used Lucerne.Net from ASP.Net? Does it take a lot of memory? Any problems? Any comments?

  Read the article

• Level-order in Haskell

  - by brain_damage

  I have a structure for a tree and I want to print the tree by levels. data Tree a = Nd a [Tree a] deriving Show type Nd = String tree = Nd "a" [Nd "b" [Nd "c" [], Nd "g" [Nd "h" [], Nd "i" [], Nd "j" [], Nd "k" []]], Nd "d" [Nd "f" []], Nd "e" [Nd "l" [Nd "n" [Nd "o" []]], Nd "m" []]] preorder (Nd x ts) = x : concatMap preorder ts postorder (Nd x ts) = (concatMap postorder ts) ++ [x] But how to do it by levels? "levels tree" should print ["a", "bde", "cgflm", "hijkn", "o"]. I think that "iterate" would be suitable function for the purpose, but I cannot come up with a solution how to use it. Would you help me, please?

  Read the article

• How do I get classic page search back for Opera 10.5?

  - by Peter Mortensen

  I have upgraded to Opera 10.51 (from Opera 9.64). How do I get search in a page (Ctrl + F) to use a dialog box (as in 9.64) instead of the modal jumping around? (I have to press Esc in order to be able navigate with the arrow keys again and this clears the highlight of a match).

  Read the article

• How to search phrase queries in inverted index structure?

  - by Mehdi Amrollahi

  If we want to search a query like this "t1 t2 t3" (t1,t2 ,t3 must be queued) in an inverted index structure , which ways could we do ? 1-First we search the "t1" term and find all documents that contains "t1" , then do this work for "t2" and then "t3" . Then find documents that positions of "t1" , "t2" and "t3" are next to each other . 2-First we search the "t1" term and find all documents that contains "t1" , then in all documents that we found , we search the "t2" and next , in the result of this , we find documents that contains "t3" . thanks .

  Read the article

• Design suggestion for expression tree evaluation with time-series data

  - by Lirik

  I have a (C#) genetic program that uses financial time-series data and it's currently working but I want to re-design the architecture to be more robust. My main goals are: sequentially present the time-series data to the expression trees. allow expression trees to access previous data rows when needed. to optimize performance of the data access while evaluating the expression trees. keep a common interface so various types of data can be used. Here are the possible approaches I've thought about: I can evaluate the expression tree by passing in a data row into the root node and let each child node use the same data row. I can evaluate the expression tree by passing in the data row index and letting each node get the data row from a shared DataSet (currently I'm passing the row index and going to multiple synchronized arrays to get the data). Hybrid: an immutable data set is accessible by all of the expression trees and each expression tree is evaluated by passing in a data row. The benefit of the first approach is that the data row is being passed into the expression tree and there is no further query done on the data set (which should increase performance in a multithreaded environment). The drawback is that the expression tree does not have access to the rest of the data (in case some of the functions need to do calculations using previous data rows). The benefit of the second approach is that the expression trees can access any data up to the latest data row, but unless I specify what that row is, I'll have to iterate through the rows and figure out which one is the last one. The benefit of the hybrid is that it should generally perform better and still provide access to the earlier data. It supports two basic "views" of data: the latest row and the previous rows. Do you guys know of any design patterns or do you have any tips that can help me build this type of system? Should I use a DataSet to hold and present the data, or are there more efficient ways to present rows of data while maintaining a simple interface? FYI: All of my code is written in C#.

  Read the article

• Existing implementation of Btree or B+tree in Java

  - by rohit

  I am doing a project in which I require btree or b+tree data structure. Does anyone know of an existing implementation of btree or b+tree (with insert, delete, search algorithms)? It should accept string as input and form btree or b+tree of these string.

  Read the article

• Asp.Net tree view in SharePoint webpart- Input string error

  - by Faiz

  Hi All, I am facing a very strange issue. I have a SharePoint webpart that displays an asp.net tree view. It takes tree depth from a drop down. To improve performance of the tree view, i am setting the PopulateOnDemand property to true for the last level of the tree depth. For example, if i have a total of 10 levels in the data and the user selects tree depth as 3, then the third level data i set PopulateOnDemand to true. Now comes the strange part. When i click on the + image on the third level, and if there are children under that particular node then call back happens and node gets expanded. But if there no children for that particular node, then click + throws "Input string was not in the correct format" error. I have made sure that there is no server side error. Some things looks to be fishy when internet explorer is trying to bind construct the expanded node. Please let me know if any one faced similar issue or the resolution for the same? Thanks in advance

  Read the article

• Example of tree.drop_mode with jQuery sortable anywhere

  - by fred

  Hello Everyone, I have a working tree of galleries next to a sortable list of image thumbnails. I've been vainly trying to set up the galleries tree so that users can add images to the galleries by dropping the sortable thumbnails on to the galleries tree. I've been told this requires drop_mode. All efforts to get it to work have failed and I can't really make heads or tails of the drop_mode documentation. I've sought out some working examples via Google of just such an application but have failed. Can anyone point me to a working example of either a draggable or sortable list that successfully drops on to a tree and passes along some parameters between the two? Thanks!

  Read the article

• Adding UIComponent to both Canvas and Tree in Flex 3

  - by Chris M

  I currently am trying to add a custom class which subclasses UIComponent to both a tree and a canvas, but when I try to re-order the tree by dragging I get this error: TypeError: Error #1010: A term is undefined and has no properties. at mx.controls::Tree/get firstVisibleItem()[C:\autobuild\3.2.0\frameworks\projects\framework\src\mx\controls\Tree.as:764] at flash.utils::ByteArray/writeObject() at flash.desktop::Clipboard/putSerialization() at flash.desktop::Clipboard/convertFlashFormat() at flash.desktop::Clipboard/setData() at mx.managers::NativeDragManagerImpl/doDrag()[C:\autobuild\3.2.0\frameworks\projects\airframework\src\mx\managers\NativeDragManagerImpl.as:282] at mx.managers::DragManager$/doDrag()[C:\autobuild\3.2.0\frameworks\projects\framework\src\mx\managers\DragManager.as:243] at mx.controls.listClasses::ListBase/dragStartHandler()[C:\autobuild\3.2.0\frameworks\projects\framework\src\mx\controls\listClasses\ListBase.as:9085] at flash.events::EventDispatcher/dispatchEventFunction() at flash.events::EventDispatcher/dispatchEvent() at mx.core::UIComponent/dispatchEvent()[C:\autobuild\3.2.0\frameworks\projects\framework\src\mx\core\UIComponent.as:9298] at mx.controls.listClasses::ListBase/mouseMoveHandler()[C:\autobuild\3.2.0\frameworks\projects\framework\src\mx\controls\listClasses\ListBase.as:8822] When I do not add the UIComponent to the canvas, this error does not occur, anyone have any knowledge as to why this happens?

  Read the article

• Can I perform a search on mail server in Java?

  - by twofivesevenzero

  I am trying to perform a search of my gmail using Java. With JavaMail I can do a message by message search like so: Properties props = System.getProperties(); props.setProperty("mail.store.protocol", "imaps"); Session session = Session.getDefaultInstance(props, null); Store store = session.getStore("imaps"); store.connect("imap.gmail.com", "myUsername", "myPassword"); Folder inbox = store.getFolder("Inbox"); inbox.open(Folder.READ_ONLY); SearchTerm term = new SearchTerm() { @Override public boolean match(Message mess) { try { return mess.getContent().toString().toLowerCase().indexOf("boston") != -1; } catch (IOException ex) { Logger.getLogger(JavaMailTest.class.getName()).log(Level.SEVERE, null, ex); } catch (MessagingException ex) { Logger.getLogger(JavaMailTest.class.getName()).log(Level.SEVERE, null, ex); } return false; } }; Message[] searchResults = inbox.search(term); for(Message m:searchResults) System.out.println("MATCHED: " + m.getFrom()[0]); But this requires downloading each message. Of course I can cache all the results, but this becomes a storage concern with large gmail boxes and also would be very slow (I can only imagine how long it would take to search through gigabytes of text...). So my question is, is there a way of searching through mail on the server, a la gmail's search field? Maybe through Microsoft Exchange? Hours of Googling has turned up nothing.

  Read the article

• Which DHCP Client OS Support DHCP Option 119 Domain Suffix Search?

  - by netlinxman

  The ability for DHCP servers (Microsoft, ISC, VitalQIP, IPControl, Infoblox, etc.) to deliver DHCP Option 119 - Domain Suffix Search Lists has been around for a long time. Initially, DHCP Client Support for this option was scarce. So, my question is this: Which DHCP Client Operating Systems support the use of DHCP Option 119 sent from a DHCP server? I am specifically looking for Mfg, and family/version/release info. Thanks!

  Read the article

• Where can I find a list of reserved words for Oracle fulltext search?

  - by Tyronomo

  I've a client testing the full text (example below) search on a new Oracle UCM site. The random text string they chose to test was 'test only'. Which failed; from my testing it seems 'only' is a reserved word, as it is never returned from a full text search (it is returned from metadata searches). I've spent the morning searching oracle.com and found this which seems pretty comprehensive, yet does not have 'only'. So my question is thus, is 'only' a reserved word. Where can I find a complete list of reserved words for Oracle full text search (10g)? Full text search string example; (<ftx>test only</ftx>)

  Read the article

• sql statement to Expression tree

  - by Joo Park

  I'm wondering how one would translate a sql string to an expression tree. Currently, in Linq to SQL, the expression tree is translated to a sql statement. How does on go the other way? How would you translate select * from books where bookname like '%The%' and year > 2008 into an expression tree in c#?

  Read the article

< Previous Page | 58 59 60 61 62 63 64 65 66 67 68 69  | Next Page >