English
Related papers

Related papers: Estimating Absolute Web Crawl Coverage From Longit…

200 papers

Online coverage planning can be useful in applications like field monitoring and search and rescue. Without prior information of the environment, achieving resolution-complete coverage considering the non-holonomic mobility constraints in…

Robotics · Computer Science 2020-07-01 Xinyue Kan , Hanzhe Teng , Konstantinos Karydis

An accurate and fast estimation of the available bandwidth in a network with varying cross-traffic is a challenging task. The accepted probing tools, based on the fluid-flow model of a bottleneck link with first-in, first-out multiplexing,…

Networking and Internet Architecture · Computer Science 2019-06-18 Sukhpreet Kaur Khangura , Sami Akın

The great performance of machine learning algorithms and deep neural networks in several perception and control tasks is pushing the industry to adopt such technologies in safety-critical applications, as autonomous robots and self-driving…

Machine Learning · Computer Science 2025-09-10 Giulio Rossolini , Alessandro Biondi , Giorgio Buttazzo

Search engines are a combination of hardware and computer software supplied by a particular company through the website which has been determined. Search engines collect information from the web through bots or web crawlers that crawls the…

Information Retrieval · Computer Science 2014-10-22 Ahmad Josi , Leon Andretti Abdillah , Suryayusra

Crawler-based search engines are the mostly used search engines among web and Internet users, involve web crawling, storing in database, ranking, indexing and displaying to the user. But it is noteworthy that because of increasing changes…

Information Retrieval · Computer Science 2013-05-14 Ali Tourani , Amir Seyed Danesh

Online network crawling tasks require a lot of efforts for the researchers to collect the data. One of them is identification of important nodes, which has many applications starting from viral marketing to the prevention of disease spread.…

Social and Information Networks · Computer Science 2024-03-22 Mikhail Drobyshevskiy , Denis Aivazov , Denis Turdakov , Alexander Yatskov , Maksim Varlamov , Danil Shayhelislamov

Curated web archive collections contain focused digital contents which are collected by archiving organizations to provide a representative sample covering specific topics and events to preserve them for future exploration and analysis. In…

Digital Libraries · Computer Science 2017-02-02 Zeon Trevor Fernando , Ivana Marenzi , Wolfgang Nejdl , Rishita Kalyani

In this work, we study how URL extraction results depend on input format. We compiled a pilot dataset by extracting URLs from 10 arXiv papers and used the same heuristic method to extract URLs from four formats derived from the PDF files or…

Digital Libraries · Computer Science 2025-09-08 Rochana R. Obadage , Lamia Salsabil , Sawood Alam , Bipasha Banarjee , William A. Ingram , Edward A. Fox , Jian Wu

With the increase in size of web, the information is also spreading at large scale. Search Engines are the medium to access this information. Crawler is the module of search engine which is responsible for download the web pages. In order…

Information Retrieval · Computer Science 2016-11-07 Deepika , Ashutosh Dixit

Data analysis impacts virtually every aspect of our society today. Often, this analysis is performed on an existing dataset, possibly collected through a process that the data scientists had limited control over. The existing data analyzed…

Databases · Computer Science 2023-04-27 Abolfazl Asudeh , Zhongjun Jin , H. V. Jagadish

Data stream algorithms tackle operations on high-volume sequences of read-once data items. Data stream scenarios include inherently real-time systems like sensor networks and financial markets. They also arise in purely-computational…

Data Structures and Algorithms · Computer Science 2024-03-04 Matthew Andres Moreno , Santiago Rodriguez Papa , Emily Dolson

Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures can be difficult, due to the issues of scale involved. In…

Statistics Theory · Mathematics 2007-06-13 David B. Chua , Eric D. Kolaczyk , Mark Crovella

Web usage mining: automatic discovery of patterns in clickstreams and associated data collected or generated as a result of user interactions with one or more Web sites. This paper describes web usage mining for our college log files to…

Databases · Computer Science 2013-10-10 Dhanamma Jagli , Sangeeta Oswal

Query execution over the Web of Linked Data has attracted much attention recently. A particularly interesting approach is link traversal based query execution which proposes to integrate the traversal of data links into the construction of…

Databases · Computer Science 2012-04-23 Olaf Hartig , Johann-Christoph Freytag

An extensive body of research deals with estimating the correlation and the Hurst parameter of Internet traffic traces. The significance of these statistics is due to their fundamental impact on network performance. The coverage of Internet…

Networking and Internet Architecture · Computer Science 2012-08-15 Amr Rizk , Zdravko Bozakov , Markus Fidler

We introduce collapsed compilation, a novel approximate inference algorithm for discrete probabilistic graphical models. It is a collapsed sampling algorithm that incrementally selects which variable to sample next based on the partial…

Artificial Intelligence · Computer Science 2018-06-01 Tal Friedman , Guy Van den Broeck

Censorship of the Internet is widespread around the world. As access to the web becomes increasingly ubiquitous, filtering of this resource becomes more pervasive. Transparency about specific content that citizens are denied access to is…

Computers and Society · Computer Science 2018-04-20 Alexander Darer , Oliver Farnan , Joss Wright

Bin covering is a dual version of classic bin packing. Thus, the goal is to cover as many bins as possible, where covering a bin means packing items of total size at least one in the bin. For online bin covering, competitive analysis fails…

Data Structures and Algorithms · Computer Science 2014-02-28 Marie G. Christ , Lene M. Favrholdt , Kim S. Larsen

We consider information diffusion on Web-like networks and how random walks can simulate it. A well-studied problem in this domain is Partial Cover Time, i.e., the calculation of the expected number of steps a random walker needs to visit a…

Social and Information Networks · Computer Science 2020-05-19 Stefania Costantini , Pasquale De Meo , Angelo Giorgianni , Valentina Migliorato , Alessandro Provetti , Federico Salvia

Web archives are typically very broad in scope and extremely large in scale. This makes data analysis appear daunting, especially for non-computer scientists. These collections constitute an increasingly important source for researchers in…

Digital Libraries · Computer Science 2017-07-31 Gerhard Gossen , Elena Demidova , Thomas Risse
‹ Prev 1 3 4 5 6 7 10 Next ›