Results 1  10
of
2,484
SYMMETRY AND UNIMODALITY IN THE q, x, yHIT NUMBERS
 SÉMINAIRE LOTHARINGIEN DE COMBINATOIRE 54A (2006), ARTICLE B54AE
, 2006
"... We prove symmetry, and in some cases symmetry and unimodality, of polynomials related to the q, x, yhit numbers introduced by Haglund. These results generalize theorems proven by Haglund for the qhit numbers. We also apply one of these results to obtain a corollary concerning a generalization of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We prove symmetry, and in some cases symmetry and unimodality, of polynomials related to the q, x, yhit numbers introduced by Haglund. These results generalize theorems proven by Haglund for the qhit numbers. We also apply one of these results to obtain a corollary concerning a generalization
Hit Number of Directed Bipartite Graphs
"... A total coloring f of a directed graph G is called edgeirregular if for any two edges e1 = u1v1 and e2 = u2v2 of G the associated ordered triples (f(u1),f(e1),f(v1)) and (f(u2),f(e2),f(v2)) are different. The problem is to determine the minimum number of colors used in such a coloring of G. This pa ..."
Abstract
 Add to MetaCart
A total coloring f of a directed graph G is called edgeirregular if for any two edges e1 = u1v1 and e2 = u2v2 of G the associated ordered triples (f(u1),f(e1),f(v1)) and (f(u2),f(e2),f(v2)) are different. The problem is to determine the minimum number of colors used in such a coloring of G
W.: Automated extraction of hit numbers from search result pages
 In: Proceedings of WAIM ’06
, 2006
"... Abstract. When a query is submitted to a search engine, the search engine returns a dynamically generated result page that contains the number of hits (i.e., the number of matching results) for the query. Hit number is a very useful piece of information in many important applications such as obtain ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. When a query is submitted to a search engine, the search engine returns a dynamically generated result page that contains the number of hits (i.e., the number of matching results) for the query. Hit number is a very useful piece of information in many important applications
Summary cache: A scalable widearea web cache sharing protocol
, 1998
"... The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called "Summary Cache"; each proxy keeps a su ..."
Abstract

Cited by 894 (3 self)
 Add to MetaCart
% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies.
Web Caching and Zipflike Distributions: Evidence and Implications
 IN INFOCOM
, 1999
"... This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2] ..."
Abstract

Cited by 1091 (2 self)
 Add to MetaCart
]. The ;econd issue relates to a number of recent studies on the characteristics of web proxy traces, which have shown that the hitratios and temporal locality of the traces exhibit certain asymptotic properties that are uniform across the different sets of the traces [43, [XO], [71, [XO], [XS]. In partlc
Expected Numbers at Hitting Times
 J. Graph Theory
, 1991
"... We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with n isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers
Removal Policies in Network Caches for WorldWide Web Documents
, 1996
"... WorldWide Web proxy servers that cache documents can potentially reduce three quantities: the number of requests that reach popular servers, the volume of network traffic resulting from document requests, and the latency that an enduser experiences in retrieving a document. This paper examines the ..."
Abstract

Cited by 227 (4 self)
 Add to MetaCart
WorldWide Web proxy servers that cache documents can potentially reduce three quantities: the number of requests that reach popular servers, the volume of network traffic resulting from document requests, and the latency that an enduser experiences in retrieving a document. This paper examines
Cartesian Genetic Programming
, 2000
"... This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node funct ..."
Abstract

Cited by 230 (59 self)
 Add to MetaCart
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node
Lower Bounds for Numbers of ABCHits
, 2006
"... By an ABChit, we mean a triple (a; b; c) of relatively prime positive integers such that a+b = c and rad(abc) < c. Denote by N(X) the number of ABChits (a; b; c) with c X. In this paper we discuss lower bounds for N(X). In particular we prove that for every > 0 and X large enough N(X) exp ..."
Abstract
 Add to MetaCart
By an ABChit, we mean a triple (a; b; c) of relatively prime positive integers such that a+b = c and rad(abc) < c. Denote by N(X) the number of ABChits (a; b; c) with c X. In this paper we discuss lower bounds for N(X). In particular we prove that for every > 0 and X large enough N
HITSCLIP yields genomewide insights into brain alternative RNA processing
 Nature
, 2008
"... ProteinRNA interactions play critical roles in all aspects of gene expression. Here we develop a genomewide means of mapping proteinRNA binding sites in vivo, by high throughput sequencing of RNA isolated by crosslinking immunoprecipitation (HITSCLIP). HITSCLIP analysis of the neuronspecific s ..."
Abstract

Cited by 96 (3 self)
 Add to MetaCart
powerful to predict Nova action de novo. HITSCLIP revealed a large number of NovaRNA interactions in 3 ′ UTRs, leading to the discovery that Nova regulates alternative polyadenylation in the brain. HITSCLIP, therefore, provides a robust, unbiased means to identify functional proteinRNA interactions
Results 1  10
of
2,484