Search ALOE
Export resources
Add search profile
{"m_searchStringConjunction":"OR","m_searchStrings":[{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"aloe_tagValue","m_searchString":"search"},{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"aloe_creator","m_searchString":"search"},{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"aloe_description","m_searchString":"search"},{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"body","m_searchString":"search"},{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"aloe_title","m_searchString":"search"},{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"aloe_textContent","m_searchString":"search"},{"m_specialStringHandlingType":"NONE","m_weight":1.0,"m_baseNameOfSearchField":"aloe_categoryName","m_searchString":"search"}]}
Perform faceted search
Search Results
-
Global Trend Map Interactive 3D visualisiation of global Google search trends -
Google Search Appliance - Datenblatt
Views: 641 Average Rating:
Google Search Appliance - Datenblatt -
Google Maps Mania: How to Find Old Maps Online
Views: 613 Average Rating:
Google Maps Mania: How to Find Old Maps Online -
Pattern | CLiPS Pattern is a web mining module for the Python programming language. It bundles tools for data retrieval (Google + Twitter + Wikipedia API, web spider, HTML DOM parser), text analysis (rule-based shallow parser, WordNet interface, syntactical + semantical n-gram search algorithm, tf-idf + cosine similarity + LSA metrics), clustering and classification (k-means, KNN, SVM), and data visualization (graph networks). -
Large-scale Incremental Processing Using Distributed Transactions and Notifications
Views: 715 Average Rating:
Large-scale Incremental Processing Using Distributed Transactions and Notifications Updating an index of the web as documents are crawled requires continuously transforming a large repository of existing documents as new documents arrive. This task is one example of a class of data processing tasks that transform a large repository of data via small, independent mutations. These tasks lie in a gap between the capabilities of existing infrastructure. Databases do not meet the storage or throughput requirements of these tasks: Google's indexing system stores tens of petabytes of data and processes billions of updates per day on thousands of machines. MapReduce and other batch-processing systems cannot process small updates individually as they rely on creating large batches for efficiency. We have built Percolator, a system for incrementally processing updates to a large data set, and deployed it to create the Google web search index. By replacing a batch-based indexing system with an indexing system based on incremental processing using Percolator, we process the same number of documents per day, while reducing the average age of documents in Google search results by 50%. Daniel Peng, Frank Dabek -
ConceptNet 5 ConceptNet is a semantic network containing lots of things computers should know about the world, especially when understanding text written by people. It is built from nodes representing concepts, in the form of words or short phrases of natural language, and labeled relationships between them. These are the kinds of things computers need to know to search for information better, answer questions, and understand people's goals. If you wanted to build your own Watson, this should be a good place to start! Attribution-ShareAlike License (CC BY-SA) -
LOCATING LONDON'S PAST This website allows you to search a wide body of digital resources relating to early modern and eighteenth-century London, and to map the results on to a fully GIS compliant version of John Rocque's 1746 map. Locating London's Past -
An Enhanced Indexing And Ranking Technique On The Semantic Web
Views: 766 Average Rating:
An Enhanced Indexing And Ranking Technique On The Semantic Web With the fast growth of the Internet, more and more information is available on the Web. The Semantic Web has many features which cannot be handled by using the traditional search engines. It extracts metadata for each discovered Web documents in RDF or OWL formats, and computes relations between documents. We proposed a hybrid indexing and ranking technique for the Semantic Web which finds relevant documents and computes the similarity among a set of documents. First, it returns with the most related document from the repository of Semantic Web Documents (SWDs) by using a modified version of the ObjectRank technique. Then, it creates a sub-graph for the most related SWDs. Finally, It returns the hubs and authorities of these document by using the HITS algorithm. Our technique increases the quality of the results and decreases the execution time of processing the user's query. Ahmed Tolba, Nabila Eladawi, Mohammed Elmogy -
Structure Learning of Probabilistic Graphical Models: A Comprehensive Survey
Views: 605 Average Rating:
Structure Learning of Probabilistic Graphical Models: A Comprehensive Survey Probabilistic graphical models combine the graph theory and probability theory to give a multivariate statistical modeling. They provide a unified description of uncertainty using probability and complexity using the graphical model. Especially, graphical models provide the following several useful properties: - Graphical models provide a simple and intuitive interpretation of the structures of probabilistic models. On the other hand, they can be used to design and motivate new models. - Graphical models provide additional insights into the properties of the model, including the conditional independence properties. - Complex computations which are required to perform inference and learning in sophisticated models can be expressed in terms of graphical manipulations, in which the underlying mathematical expressions are carried along implicitly. The graphical models have been applied to a large number of fields, including bioinformatics, social science, control theory, image processing, marketing analysis, among others. However, structure learning for graphical models remains an open challenge, since one must cope with a combinatorial search over the space of all possible structures. In this paper, we present a comprehensive survey of the existing structure learning algorithms. Yang Zhou -
YaCy - Freie Suchmaschinensoftware und dezentrale Websuche
Views: 545 Average Rating:
YaCy - Freie Suchmaschinensoftware und dezentrale Websuche Dezentrale Web-Suche mit YaCy