Results 1  10
of
6,412
Segmentation of brain MR images through a hidden Markov random field model and the expectationmaximization algorithm
 IEEE TRANSACTIONS ON MEDICAL. IMAGING
, 2001
"... The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogrambased model, the FM has an intrinsic limi ..."
Abstract

Cited by 639 (15 self)
 Add to MetaCart
The finite mixture (FM) model is the most commonly used model for statistical segmentation of brain magnetic resonance (MR) images because of its simple mathematical form and the piecewise constant nature of ideal brain MR images. However, being a histogrambased model, the FM has an intrinsic
Mining the Peanut Gallery: Opinion Extraction and Semantic Classification of Product Reviews
, 2003
"... The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, generating a list of product attributes (quality, features, etc.) and aggregating opinions about each of them (poor, mixe ..."
Abstract

Cited by 453 (0 self)
 Add to MetaCart
The web contains a wealth of product reviews, but sifting through them is a daunting task. Ideally, an opinion mining tool would process a set of search results for a given item, generating a list of product attributes (quality, features, etc.) and aggregating opinions about each of them (poor
Bicritical rational maps: Dynamical limits and ideal limit points of period m curves
"... Kabelka Introduction. A rational map F: C ̂ → C ̂ from the Riemann sphere to itself is bicritical if it has exactly two critical points. Fix d ≥ 2 and let Bd denote the space of bicritical rational maps of degree d modulo holomorphic conjugation. The space Bd is isomorphic to C2 (by the map sending ..."
Abstract
 Add to MetaCart
Kabelka Introduction. A rational map F: C ̂ → C ̂ from the Riemann sphere to itself is bicritical if it has exactly two critical points. Fix d ≥ 2 and let Bd denote the space of bicritical rational maps of degree d modulo holomorphic conjugation. The space Bd is isomorphic to C2 (by the map sending 〈F 〉 ∈ Bd to suitable symmetric functions of the multipliers of F at its fixed points) and can be
Quadratic rational maps: Dynamical limits, disappearing limbs and ideal limit points of Pern(0) curves
"... 2 denote the moduli space of holomorphic conjugacy classes of quadratic rational maps on Ĉ. Let Per1(λ) ∼ = C denote the slice in M2 consisting of all conjugacy classes having a fixed point with multiplier λ and let Mλ ⊂ Per1(λ) denote the set of all 〈f 〉 ∈ Per1(λ) whose Julia set J(f) is connect ..."
Abstract
 Add to MetaCart
2 denote the moduli space of holomorphic conjugacy classes of quadratic rational maps on Ĉ. Let Per1(λ) ∼ = C denote the slice in M2 consisting of all conjugacy classes having a fixed point with multiplier λ and let Mλ ⊂ Per1(λ) denote the set of all 〈f 〉 ∈ Per1(λ) whose Julia set J(f) is connected. The slice Per1(0) is naturally isomorphic to the quadratic family Pc(z) = z 2 + c with c ∈ C and the connectedness locus M0 ⊂ Per1(0) is naturally isomorphic to the Mandelbrot set M = {c ∈ C: J(Pc) is connected}. For all λ ∈ D ∗ the connectedness locus Mλ in Per1(λ) is a homeomorphic copy of M. More precisely, given λ ∈ D ∗ and c ∈ M, there exists a unique 〈Rλ,c 〉 ∈ Per1(λ) that has the same dynamical behavior as the quadratic polynomial Pc, but where the superattracting fixed point at ∞ has been replaced by an attracting fixed point with multiplier λ. The map c 7 → 〈Rλ,c 〉 maps the Mandelbrot set M homeomorphically onto Mλ ⊂ Per1(λ). One can think of Rλ,c as the mating of the quadratic polynomials Pc(z) = z
Sampling—50 years after Shannon
 Proceedings of the IEEE
, 2000
"... This paper presents an account of the current state of sampling, 50 years after Shannon’s formulation of the sampling theorem. The emphasis is on regular sampling, where the grid is uniform. This topic has benefited from a strong research revival during the past few years, thanks in part to the math ..."
Abstract

Cited by 339 (27 self)
 Add to MetaCart
to the mathematical connections that were made with wavelet theory. To introduce the reader to the modern, Hilbertspace formulation, we reinterpret Shannon’s sampling procedure as an orthogonal projection onto the subspace of bandlimited functions. We then extend the standard sampling paradigm for a representation
Fair Scheduling in Wireless Packet Networks
 IEEE/ACM Transactions on Networking
, 1997
"... Fair scheduling of delay and ratesensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, and (b) locationdependent channel capacity and e ..."
Abstract

Cited by 338 (21 self)
 Add to MetaCart
and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however a base station has only a limited knowledge of the arrival processes of uplink flows. In this paper, we propose a new model for wireless
SPRINT: A scalable parallel classifier for data mining
, 1996
"... Classification is an important data mining problem. Although classification is a wellstudied problem, most of the current classification algorithms require that all or a portion of the the entire dataset remain permanently in memory. This limits their suitability for mining over large databases. ..."
Abstract

Cited by 312 (8 self)
 Add to MetaCart
Classification is an important data mining problem. Although classification is a wellstudied problem, most of the current classification algorithms require that all or a portion of the the entire dataset remain permanently in memory. This limits their suitability for mining over large databases
Developments in the Measurement of Subjective WellBeing
 Psychological Science.
, 1993
"... F or good reasons, economists have had a longstanding preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract

Cited by 284 (7 self)
 Add to MetaCart
the respondents' remembered utility. The evaluation of remembered utility requires the individual to remember a stream of experiences and to aggregate them in some way. Ideally, one would hope that the individual who reports his or her overall remembered utility for a period performs the task of summing
A theory of catadioptric image formation
, 1997
"... Conventional video cameras have limited elds of view which make them restrictive for certain applications in computational vision. A catadioptric sensor uses a combination of lenses and mirrors placed in a carefully arranged con guration to capture a much wider eld of view. When designing a catadiop ..."
Abstract

Cited by 233 (19 self)
 Add to MetaCart
Conventional video cameras have limited elds of view which make them restrictive for certain applications in computational vision. A catadioptric sensor uses a combination of lenses and mirrors placed in a carefully arranged con guration to capture a much wider eld of view. When designing a
Frequency estimation of internet packet streams with limited space
 IN PROCEEDINGS OF THE 10TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS
, 2002
"... We consider a router on the Internet analyzing the statistical properties of a TCP/IP packet stream. A fundamental difficulty with measuring traffic behavior on the Internet is that there is simply too much data to be recorded for later analysis, on the order of gigabytes a second. As a result, net ..."
Abstract

Cited by 168 (1 self)
 Add to MetaCart
, network routers can collect only relatively few statistics about the data. The central problem addressed here is to use the limited memory of routers to determine essential features of the network traffic stream. A particularly difficult and representative subproblem is to determine the top k categories
Results 1  10
of
6,412