Results 1  10
of
240
On nearuniform URL sampling
, 2000
"... We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the fraction of pages in various Internet domains or written in various languages. Moreover, uniform URL sampling can be used ..."
Abstract

Cited by 124 (6 self)
 Add to MetaCart
We consider the problem of sampling URLs uniformly at random from the Web. A tool for sampling URLs uniformly can be used to estimate various properties of Web pages, such as the fraction of pages in various Internet domains or written in various languages. Moreover, uniform URL sampling can
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
to consider only the significant terms in Eqs. [27] and [28] and restrict higher order fitting to border regions. RESULTS Sensitivity encoding using common Cartesian sampling of kspace and DFTbased reconstruction was performed in vitro and in vivo on a Philips Gyroscan ACSNT15 at 1.5 T. Phantom
Sampling
"... This chapter describes the sample design developed and implemented for TIMSS Advanced 2008 and the derivation of sampling weights for the study. It explains how the target populations were defined in the participating countries and how the national sample designs were developed and implemented. It a ..."
Abstract
 Add to MetaCart
. It also explains how the sampling weights and participation rates were calculated. To complement the general information in this chapter, Appendix B provides specific details about the national sample designs and their implementation, including details of population coverage and exclusions, stratification
Uniform Coverage Control of Mobile Sensor Networks for Dynamic Target Detection
"... Abstract — In surveillance problems, the uncertainty in the position of a target can be specified in terms of a probability distribution. To reduce the average search times to detect a target using mobile sensors, it is desirable to have the trajectories of the sensors sample the probability distrib ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
coverage of the evolving probability distribution. Using these metrics, we derive centralized feedback control laws for the motion of the sensors so that they achieve uniform coverage of the moving target distribution. We demonstrate the performance of the algorithm on various scenarios. I.
Comparing Methods for NearUniform URL Sampling
"... This diploma thesis investigated the problem of sampling URLs uniformly at random from the web. Such a method for sampling URLs can be used to estimate various properties of web pages. For example, one could estimate: • The fraction of web pages written in various languages • The coverage of various ..."
Abstract
 Add to MetaCart
This diploma thesis investigated the problem of sampling URLs uniformly at random from the web. Such a method for sampling URLs can be used to estimate various properties of web pages. For example, one could estimate: • The fraction of web pages written in various languages • The coverage
Some Comments on Sampling, Antenna Spacings, and Uniform Aperture Illumination
"... Introduction The general scheme for measuring shortspacing interferometer data that is planned for the MMA is a method known as "mosiacing", as outlined by Cornwell, MMA memo no. 24, and further developed in Cornwell et al (1993). This uses scanning or multiple pointing of the interferome ..."
Abstract
 Add to MetaCart
of the interferometer antennas during tracking to extend the uv coverage of close pairs into the circle of radius D, one antenna diameter. This extension will then overlap the uv coverage provided by single dish maps made by individual interferometer antennas. For source declinations that are sufficiently different
Efficient Algorithms for Generation of Combinatorial Covering Suites
"... In this note we describe efficient algorithms for generating tests that cover a prescribed set of combinations of a software system's input parameters. Our methods for obtaining uniform twise coverage are based on repeatedly coloring the vertices of a graph such that the vertices in each tsub ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this note we describe efficient algorithms for generating tests that cover a prescribed set of combinations of a software system's input parameters. Our methods for obtaining uniform twise coverage are based on repeatedly coloring the vertices of a graph such that the vertices in each t
SEISMIC DATA INVERSION BY CROSSHOLE TOMOGRAPHY USING GEOMETRICALLY UNIFORM SPATIAL COVERAGE
"... ABSTRACT. One of the inversion schemes most employed in seismic tomography processing is least squares and derived algorithms, using as input data the vector of first arrivals. A division of the whole space between sources and receivers is performed, constructing a pixel model with its elements of t ..."
Abstract
 Add to MetaCart
of the same size. Spatial coverage is defined, then, as the sum of traveled length by all rays through every pixel that conform the medium considered. It is related, therefore, with the sourcereceiver’s distribution and the form of the domain among them. In crosshole array, rays do not evenly sample
Approximating Aggregate Queries about Web Pages via Random Walks
 In Proceedings of the 26th International Conference on Very Large Data Bases (VLDB
, 2000
"... We present a random walk as an eÆcient and accurate approach to approximating certain aggregate queries about web pages. Our method uses a novel random walk to produce an almost uniformly distributed sample of web pages. The walk traverses a dynamically built regular undirected graph. Queries we ha ..."
Abstract

Cited by 78 (9 self)
 Add to MetaCart
We present a random walk as an eÆcient and accurate approach to approximating certain aggregate queries about web pages. Our method uses a novel random walk to produce an almost uniformly distributed sample of web pages. The walk traverses a dynamically built regular undirected graph. Queries we
Results 1  10
of
240