Results 1  10
of
4,184,823
The Lifting Scheme: A Construction Of Second Generation Wavelets
, 1997
"... . We present the lifting scheme, a simple construction of second generation wavelets, wavelets that are not necessarily translates and dilates of one fixed function. Such wavelets can be adapted to intervals, domains, surfaces, weights, and irregular samples. We show how the lifting scheme leads to ..."
Abstract

Cited by 541 (16 self)
 Add to MetaCart
to a faster, inplace calculation of the wavelet transform. Several examples are included. Key words. wavelet, multiresolution, second generation wavelet, lifting scheme AMS subject classifications. 42C15 1. Introduction. Wavelets form a versatile tool for representing general functions or data sets
Inverse Acoustic and Electromagnetic Scattering Theory, Second Edition
, 1998
"... Abstract. This paper is a survey of the inverse scattering problem for timeharmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newtontype methods for solving the inverse scattering problem for acoustic waves, including a brief discussi ..."
Abstract

Cited by 1072 (45 self)
 Add to MetaCart
Abstract. This paper is a survey of the inverse scattering problem for timeharmonic acoustic and electromagnetic waves at fixed frequency. We begin by a discussion of “weak scattering ” and Newtontype methods for solving the inverse scattering problem for acoustic waves, including a brief discussion of Tikhonov’s method for the numerical solution of illposed problems. We then proceed to prove a uniqueness theorem for the inverse obstacle problems for acoustic waves and the linear sampling method for reconstructing the shape of a scattering obstacle from far field data. Included in our discussion is a description of Kirsch’s factorization method for solving this problem. We then turn our attention to uniqueness and reconstruction algorithms for determining the support of an inhomogeneous, anisotropic media from acoustic far field data. Our survey is concluded by a brief discussion of the inverse scattering problem for timeharmonic electromagnetic waves. 1.
Myrinet: A GigabitperSecond Local Area Network
 IEEE Micro
, 1995
"... Abstract. Myrinet is a new type of localarea network (LAN) based on the technology used for packet communication and switching within "massivelyparallel processors " (MPPs). Think of Myrinet as an MPP messagepassing network that can span campus dimensions, rather than as a widea ..."
Abstract

Cited by 1008 (0 self)
 Add to MetaCart
on the messagepassing network due to the larger number of nodes and a greater interdependence between the computing processes on different nodes. The messagepassingnetwork technology developed for the Mosaic [6] achieved its goals so well that it was used in several other MPP systems, including the
Resilient Overlay Networks
, 2001
"... A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s widearea routing protocols that take at least several minutes to recover. A R ..."
Abstract

Cited by 1163 (34 self)
 Add to MetaCart
A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today’s widearea routing protocols that take at least several minutes to recover. A
The capacity of wireless networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2000
"... When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally p ..."
Abstract

Cited by 3240 (43 self)
 Add to MetaCart
When n identical randomly located nodes, each capable of transmitting at bits per second and using a fixed range, form a wireless network, the throughput @ A obtainable by each node for a randomly chosen destination is 2 bits per second under a noninterference protocol. If the nodes are optimally
A tutorial on hidden Markov models and selected applications in speech recognition
 PROCEEDINGS OF THE IEEE
, 1989
"... Although initially introduced and studied in the late 1960s and early 1970s, statistical methods of Markov source or hidden Markov modeling have become increasingly popular in the last several years. There are two strong reasons why this has occurred. First the models are very rich in mathematical s ..."
Abstract

Cited by 5764 (1 self)
 Add to MetaCart
structure and hence can form the theoretical basis for use in a wide range of applications. Second the models, when applied properly, work very well in practice for several important applications. In this paper we attempt to carefully and methodically review the theoretical aspects of this type
Optimal Brain Damage
, 1990
"... We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved sp ..."
Abstract

Cited by 511 (5 self)
 Add to MetaCart
We have used informationtheoretic ideas to derive a class of practical and nearly optimal schemes for adapting the size of a neural network. By removing unimportant weights from a network, several improvements can be expected: better generalization, fewer training examples required, and improved
Sorting networks and their applications
, 1968
"... To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing ..."
Abstract

Cited by 660 (0 self)
 Add to MetaCart
To achieve high throughput rates today's computers perform several operations simultaneously. Not only are I/O operations performed concurrently with computing, but also, in multiprocessors, several computing
Maximum Likelihood Phylogenetic Estimation from DNA Sequences with Variable Rates over Sites: Approximate Methods
 J. Mol. Evol
, 1994
"... Two approximate methods are proposed for maximum likelihood phylogenetic estimation, which allow variable rates of substitution across nucleotide sites. Three data sets with quite different characteristics were analyzed to examine empirically the performance of these methods. The first, called ..."
Abstract

Cited by 540 (28 self)
 Add to MetaCart
, and four such categories appear to be sufficient to produce both an optimum, or nearoptimum fit by the model to the data, and also an acceptable approximation to the continuous dis tribution. The second method, called "fixedrates mod el," classifies sites into several classes according
Results 1  10
of
4,184,823