name stringlengths 1 3 | title stringlengths 17 118 | abstract stringlengths 268 2.12k | fulltext stringlengths 8.6k 78.1k | keywords stringlengths 28 1.35k |
|---|---|---|---|---|
1 | 2-Source Dispersers for Sub-Polynomial Entropy and Ramsey Graphs Beating the Frankl-Wilson Construction | The main result of this paper is an explicit disperser for two independent sources on n bits, each of entropy k = n o(1). Put differently, setting N = 2n and K = 2k , we construct explicit N N Boolean matrices for which no K K sub-matrix is monochromatic. Viewed as adjacency matrices of bipartite graphs, this gives a... | INTRODUCTION
This paper deals with randomness extraction from weak
random sources. Here a weak random source is a distribution
which contains some entropy. The extraction task is to
design efficient algorithms (called extractors) to convert this
entropy into useful form, namely a sequence of independent
unbiased bits. ... | sum-product theorem;distribution;explicit disperser;construction of disperser;Extractors;recursion;subsource somewhere extractor;structure;bipartite graph;extractors;independent sources;extractor;tools;Ramsey Graphs;disperser;polynomial time computable disperser;resiliency;Theorem;Ramsey graphs;block-sources;deficiency... |
10 | A Frequency-based and a Poisson-based Definition of the Probability of Being Informative | This paper reports on theoretical investigations about the assumptions underlying the inverse document frequency (idf ). We show that an intuitive idf -based probability function for the probability of a term being informative assumes disjoint document events. By assuming documents to be independent rather than disjoin... | INTRODUCTION AND BACKGROUND
The inverse document frequency (idf ) is one of the most
successful parameters for a relevance-based ranking of retrieved
objects. With N being the total number of documents
, and n(t) being the number of documents in which
term t occurs, the idf is defined as follows:
idf(t) := - log n(t)
N... | inverse document frequency (idf);independent and disjoint documents;computer science;information search;probability theories;Poisson based probability;Term frequency;probabilistic retrieval models;Probability of being informative;Independent documents;Disjoint documents;Normalisation;relevance-based ranking of retrieve... |
100 | High Performance Crawling System | In the present paper, we will describe the design and implementation of a real-time distributed system of Web crawling running on a cluster of machines. The system crawls several thousands of pages every second, includes a high-performance fault manager, is platform independent and is able to adapt transparently to a w... | INTRODUCTION
With the World Wide Web containing the vast amount
of information (several thousands in 1993, 3 billion today)
that it does and the fact that it is ever expanding, we
need a way to find the right information (multimedia of
textual).
We need a way to access the information on
specific subjects that we requi... | Breadth first crawling;Hierarchical Cooperation;limiting disk access;fault tolerance;Dominos nodes;dominos process;Dominos distributed database;breadth-first crawling;repetitive crawling;URL caching;Dominos Generic server;Document fingerprint;Deep web crawling;Dominos RPC concurrent;Random walks and sampling;Web Crawle... |
101 | Hiperlan/2 Public Access Interworking with 3G Cellular Systems | This paper presents a technical overview of the Hiperlan/2 3G interworking concept. It does not attempt to provide any business justification or plan for Public Access operation. After a brief resume of public access operation below, section 2 then introduces an overview of the technologies concerned. Section 3 describ... | 1.1. Public access operation
Recently, mobile business professionals have been looking
for a more efficient way to access corporate information systems
and databases remotely through the Internet backbone.
However, the high bandwidth demand of the typical office applications
, such as large email attachment downloading... | Hiperlan/2;interworking;3G;ETSI;BRAN;WIG;public access |
102 | 2D Information Displays | "Many exploration and manipulation tasks benefit from a coherent integration of multiple views onto (...TRUNCATED) | "INTRODUCTION\nIn many areas knowledge about structures and their meaning\nas well as their spatial (...TRUNCATED) | Information visualization;Spreading activation |
103 | Impedance Coupling in Content-targeted Advertising | "The current boom of the Web is associated with the revenues originated from on-line advertising. Wh(...TRUNCATED) | "INTRODUCTION\nThe emergence of the Internet has opened up new marketing\nopportunities. In fact, a (...TRUNCATED) | ";advertisements;triggering page;Bayesian networks;Advertising;matching;kNN;Web;content-targeted adv(...TRUNCATED) |
104 | Implementing the IT Fundamentals Knowledge Area | "The recently promulgated IT model curriculum contains IT fundamentals as one of its knowledge areas(...TRUNCATED) | "INTRODUCTION\nThe recently promulgated IT Model Curriculum, available at\nhttp://sigite.acm.org/act(...TRUNCATED) | IT Fundamentals Knowledge Area;IT Model Curriculum |
105 | Implicit User Modeling for Personalized Search | "Information retrieval systems (e.g., web search engines) are critical for overcoming information ov(...TRUNCATED) | "INTRODUCTION\nAlthough many information retrieval systems (e.g., web search\nengines and digital li(...TRUNCATED) | "user model;interactive retrieval;personalized search;information retrieval systems;user modelling;i(...TRUNCATED) |
106 | Improvements of TLAESA Nearest Neighbour Search Algorithm and Extension to Approximation Search | "Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern (...TRUNCATED) | "Introduction\nNN and k-NN searches are techniques which find the\nclosest object (closest k objects(...TRUNCATED) | "Approximation Search;TLAESA;Distance Computaion;k Nearest Neighbour Search;Nearest Neighbour Search(...TRUNCATED) |
107 | Improving the Static Analysis of Embedded Languages via Partial Evaluation | "Programs in embedded languages contain invariants that are not automatically detected or enforced b(...TRUNCATED) | "1. One Language, Many Languages\nEvery practical programming language contains small programming\nl(...TRUNCATED) | "macros;interpreter;value flow analysis;flow analysis;set-based analysis;partial evaluation;embedded(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 27