Results 11  20
of
2,366
Image compression via joint statistical characterization in the wavelet domain
, 1997
"... We develop a statistical characterization of natural images in the wavelet transform domain. This characterization describes the joint statistics between pairs of subband coefficients at adjacent spatial locations, orientations, and scales. We observe that the raw coefficients are nearly decorrelate ..."
Abstract

Cited by 238 (24 self)
 Add to MetaCart
We develop a statistical characterization of natural images in the wavelet transform domain. This characterization describes the joint statistics between pairs of subband coefficients at adjacent spatial locations, orientations, and scales. We observe that the raw coefficients are nearly
On Singletons and Adjacencies of Set Partitions of Type B
"... We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zeroblock, in analogy with the result of Callan for ordinary partitions. ..."
Abstract
 Add to MetaCart
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zeroblock, in analogy with the result of Callan for ordinary partitions.
On the Origins of Power Laws in Internet Topologies
 39th Annual Allerton Conference on Communication, Control, and Computing, 2001 www.merit.edu/~mrt
"... Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (i ..."
Abstract

Cited by 220 (4 self)
 Add to MetaCart
Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form � for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size
Identifying agreement and disagreement in conversational speech: Use of Bayesian networks to model pragmatic dependencies
 In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL
, 2004
"... We describe a statistical approach for modeling agreements and disagreements in conversational interaction. Our approach first identifies adjacency pairs using maximum entropy ranking based on a set of lexical, durational, and structural features that look both forward and backward in the discourse. ..."
Abstract

Cited by 101 (5 self)
 Add to MetaCart
We describe a statistical approach for modeling agreements and disagreements in conversational interaction. Our approach first identifies adjacency pairs using maximum entropy ranking based on a set of lexical, durational, and structural features that look both forward and backward in the discourse
Curves, hypersurfaces, and good pairs of adjacency relations
 Lecture Notes in Computer Science, No 3322:270– 284
, 2004
"... Abstract. In this paper we propose several equivalent definitions of digital curves and hypersurfaces in arbitrary dimension. The definitions involve properties such as onedimensionality of curves and (n − 1)dimensionality of hypersurfaces that make them discrete analogs of corresponding notions in ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
hypersurfaces, we propose a uniform approach for studying good pairs defined by separations and obtain a classification of good pairs in arbitrary dimension.
Adjacency Concept for Pairs of Natural Numbers Yatsuka Nakamura
"... Summary. First, we introduce the concept of adjacency for a pair of natural numbers. Second, we extend the concept for two pairs of natural numbers. The pairs represent points of a lattice in a plane. We show that if some property is infectious among adjacent points, and some points have the propert ..."
Abstract
 Add to MetaCart
Summary. First, we introduce the concept of adjacency for a pair of natural numbers. Second, we extend the concept for two pairs of natural numbers. The pairs represent points of a lattice in a plane. We show that if some property is infectious among adjacent points, and some points have
Cacheoblivious Btrees
, 2005
"... This paper presents two dynamic search trees attaining nearoptimal performance on any hierarchical memory. The data structures are independent of the parameters of the memory hierarchy, e.g., the number of memory levels, the blocktransfer size at each level, and the relative speeds of memory leve ..."
Abstract

Cited by 149 (20 self)
 Add to MetaCart
levels. The performance is analyzed in terms of the number of memory transfers between two memory levels with an arbitrary blocktransfer size of B; this analysis can then be applied to every adjacent pair of levels in a multilevel memory hierarchy. Both search trees match the optimal search bound of Θ(1
The ICSI Meeting Recorder Dialog Act (MRDA) Corpus
 IN PROC. 5TH SIGDIAL WORKSHOP ON DISCOURSE AND DIALOGUE
, 2004
"... We describe a new corpus of over 180,000 handannotated dialog act tags and accompanying adjacency pair annotations for roughly 72 hours of speech from 75 naturallyoccurring meetings. We provide a brief summary of the annotation system and labeling procedure, interannotator reliability statistics, ..."
Abstract

Cited by 105 (9 self)
 Add to MetaCart
We describe a new corpus of over 180,000 handannotated dialog act tags and accompanying adjacency pair annotations for roughly 72 hours of speech from 75 naturallyoccurring meetings. We provide a brief summary of the annotation system and labeling procedure, interannotator reliability statistics
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case
Results 11  20
of
2,366