Results 1  10
of
652
Symmetry of local minimizers for the three dimensional . . .
, 2008
"... We classify nonconstant entire local minimizers of the standard GinzburgLandau functional for maps in H 1 loc (R³, R³) satisfying a natural energy bound. Up to translations and rotations, such solutions of the GinzburgLandau system are given by an explicit solution equivariant under the action of ..."
Abstract
 Add to MetaCart
We classify nonconstant entire local minimizers of the standard GinzburgLandau functional for maps in H 1 loc (R³, R³) satisfying a natural energy bound. Up to translations and rotations, such solutions of the GinzburgLandau system are given by an explicit solution equivariant under the action
Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web
 IN PROC. 29TH ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC
, 1997
"... We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and ..."
Abstract

Cited by 699 (10 self)
 Add to MetaCart
, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use
Université de CergyPontoise
, 804
"... Abstract. We classify nonconstant entire local minimizers of the standard GinzburgLandau functional for maps in H 1 loc (R3; R 3) satisfying a natural energy bound. Up to translations and rotations, such solutions of the GinzburgLandau system are given by an explicit solution equivariant under the ..."
Abstract
 Add to MetaCart
Abstract. We classify nonconstant entire local minimizers of the standard GinzburgLandau functional for maps in H 1 loc (R3; R 3) satisfying a natural energy bound. Up to translations and rotations, such solutions of the GinzburgLandau system are given by an explicit solution equivariant under
Bottomup computation of sparse and Iceberg CUBE
 In Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP, DOLAP ’02
, 1999
"... We introduce the IcebergCUBE problem as a reformulation of the datacube (CUBE) problem. The IcebergCUBE problem is to compute only those groupby partitions with an aggregate value (e.g., count) above some minimum support threshold. The result of IcebergCUBE can be used (1) to answer groupby que ..."
Abstract

Cited by 187 (4 self)
 Add to MetaCart
practical advantage: BUC avoids computing the larger groupbys that do not meet minimum support. The pruning in BUC is similar to the pruning in the Apriori algorithm for association rules, except that BUC trades some pruning for locality of reference and reduced memory requirements. BUC uses the same
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
or collimation but by spectral analysis. The idea of Lauterbur (1) to encode object contrast in the resonance spectrum by a magnetic field gradient forms the exclusive basis of signal localization in Fourier imaging. However powerful, the gradientencoding concept implies a fundamental restriction. Only one
A Local Search Mechanism for PeertoPeer Networks
, 2002
"... One important problem in peertopeer (P2P) networks is searching and retrieving the correct information. However, existing searching mechanisms in pure peertopeer networks are inefficient due to the decentralized nature of such networks. We propose two mechanisms for information retrieval in pure ..."
Abstract

Cited by 151 (6 self)
 Add to MetaCart
in pure peertopeer networks. The first, the modified BreadthFirstSearch (BFS) mechanism, is an extension of the current Gnuttela protocol, allows searching with keywords, and is designed to minimize the number of messages that are needed to search the network. The second, the Intelligent Search
Accuracy characterization for metropolitanscale wifi localization
 In Proceedings of Mobisys 2005
, 2005
"... Location systems have long been identified as an important component of emerging mobile applications. Most research on location systems has focused on precise location in indoor environments. However, many location applications (for example, locationaware web search) become interesting only when th ..."
Abstract

Cited by 143 (6 self)
 Add to MetaCart
the underlying location system is available ubiquitously and is not limited to a single office environment. Unfortunately, the installation and calibration overhead involved for most of the existing research systems is too prohibitive to imagine deploying them across, say, an entire city. In this work, we
Liouville Theorems For Entire Local Minimizers Of Energies Defined On The Class L log L And For Entire Solutions Of The Stationary PrandtlEyring Fluid Model
, 2011
"... If u: R n â R M locally minimizes the energy with density âuln(1 + âu), then we show that the boundedness of the function u already implies its constancy. The same is true in case n = M = 2 for entire solutions of the equations modelling the stationary flow of a socalled PrandtlEyring f ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
If u: R n â R M locally minimizes the energy with density âuln(1 + âu), then we show that the boundedness of the function u already implies its constancy. The same is true in case n = M = 2 for entire solutions of the equations modelling the stationary flow of a socalled Prandtl
Interactive Local Adjustment of Tonal Values
"... This paper presents a new interactive tool for making local adjustments of tonal values and other visual parameters in an image. Rather than carefully selecting regions or handpainting layer masks, the user quickly indicates regions of interest by drawing a few simple brush strokes and then uses ..."
Abstract

Cited by 97 (11 self)
 Add to MetaCart
sliders to adjust the brightness, contrast, and other parameters in these regions. The effects of the user’s sparse set of constraints are interpolated to the entire image using an edgepreserving energy minimization method designed to prevent the propagation of tonal adjustments to regions
Power Supply Noise Analysis Methodology for DeepSubmicron VLSI Chip Design
, 1997
"... This paper describes a new design methodology to analyze the onchip power supply noise for highperformance microprocessors. Based on an integrated packagelevel and chiplevel power bus model, and a simulated switching circuit model for each functional block, this methodology offers the most compl ..."
Abstract

Cited by 134 (2 self)
 Add to MetaCart
complete and accurate analysis of Vdd distribution for the entire chip. The analysis results not only provide designers with the inductive #I noise and the resistive IR drop data at the same time, but also allow designers to easily identify the hot spots on the chip and #V across the chip. Global and local
Results 1  10
of
652