Results 1  10
of
11,186
Multimodality Image Registration by Maximization of Mutual Information
 IEEE TRANSACTIONS ON MEDICAL IMAGING
, 1997
"... A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence or in ..."
Abstract

Cited by 791 (10 self)
 Add to MetaCart
or information redundancy between the image intensities of corresponding voxels in both images, which is assumed to be maximal if the images are geometrically aligned. Maximization of MI is a very general and powerful criterion, because no assumptions are made regarding the nature of this dependence
Maximizing the Spread of Influence Through a Social Network
 In KDD
, 2003
"... Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in gametheoretic settings, and the effects of ..."
Abstract

Cited by 990 (7 self)
 Add to MetaCart
the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63 % of optimal for several classes of models; our framework suggests a general approach
Construction of the maximal solution of Backus’ problem
"... Let Ω denote the domain exterior to the unit sphere S. The (simplified) Backus problem consists in finding a function u ∈ C1(Ω̄), harmonic on Ω, such that u tends to zero at infinity and the norm of the gradient of u takes prescribed values on S. Apart from a change of sign, the solution is not uniq ..."
Abstract
 Add to MetaCart
is not unique in general. However, the solution is unique in the class of functions with the additional property that the radial component of the gradient of u on S is nonpositive, such as it is relevant in Geodesy. If this solution exists, then ±u are the maximal and the minimal solutions of the problem
MAXIMAL SOLUTIONS FOR −∆u + u q = 0 IN OPEN AND FINELY OPEN SETS
, 810
"... 2. Upper estimate of the maximal solution. 6 3. Lower estimate of the maximal solution 11 4. Properties of UF for F compact 18 ..."
Abstract
 Add to MetaCart
2. Upper estimate of the maximal solution. 6 3. Lower estimate of the maximal solution 11 4. Properties of UF for F compact 18
A training algorithm for optimal margin classifiers
 PROCEEDINGS OF THE 5TH ANNUAL ACM WORKSHOP ON COMPUTATIONAL LEARNING THEORY
, 1992
"... A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of classifiaction functions, including Perceptrons, polynomials, and Radial Basis Functions. The effective number of parameters is adjust ..."
Abstract

Cited by 1865 (43 self)
 Add to MetaCart
A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented. The technique is applicable to a wide variety of classifiaction functions, including Perceptrons, polynomials, and Radial Basis Functions. The effective number of parameters
Energy Conserving Routing in Wireless Adhoc Networks
, 2000
"... An adhoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and needs to reach a set of designated gateway nodes. Each node may adjust its power within a certain range that determines the set ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
with node capacities and the algorithms converge to the optimal solution. When there are multiple power levels then the achievable lifetime is close to the optimal (that is computed by linear programming) most of the time. It turns out that in order to maximize the lifetime, the traffic should be routed
Cluster Ensembles  A Knowledge Reuse Framework for Combining Multiple Partitions
 Journal of Machine Learning Research
, 2002
"... This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that determined these partitionings. We first identify several application scenarios for the resultant 'knowledge reuse&ap ..."
Abstract

Cited by 603 (20 self)
 Add to MetaCart
' framework that we call cluster ensembles. The cluster ensemble problem is then formalized as a combinatorial optimization problem in terms of shared mutual information. In addition to a direct maximization approach, we propose three effective and efficient techniques for obtaining highquality combiners
The Nonstochastic Multiarmed Bandit Problem
 SIAM JOURNAL OF COMPUTING
, 2002
"... In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying out ..."
Abstract

Cited by 491 (34 self)
 Add to MetaCart
In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the tradeoff between exploration (trying
A new maximally supersymmetric background of IIB superstring theory
, 2001
"... We present a maximally supersymmetric IIB string background. The geometry is that of a conformally flat lorentzian symmetric space G/K with solvable G, with a homogeneous fiveform flux. We give the explicit supergravity solution, compute the isometries, the 32 Killing spinors, and the symmetry supe ..."
Abstract

Cited by 405 (27 self)
 Add to MetaCart
We present a maximally supersymmetric IIB string background. The geometry is that of a conformally flat lorentzian symmetric space G/K with solvable G, with a homogeneous fiveform flux. We give the explicit supergravity solution, compute the isometries, the 32 Killing spinors, and the symmetry
Maximal solutions of nonlinear parabolic equations with absorption
"... Abstract We study the existence and the uniqueness of the solution of the problem (P): ∂tu− ∆u + f(u) = 0 in Q: = Ω × (0,∞), u = ∞ on the parabolic boundary ∂pQ when Ω is a domain in RN with a compact boundary and f a continuous increasing function satisfying super linear growth condition. We prov ..."
Abstract
 Add to MetaCart
Abstract We study the existence and the uniqueness of the solution of the problem (P): ∂tu− ∆u + f(u) = 0 in Q: = Ω × (0,∞), u = ∞ on the parabolic boundary ∂pQ when Ω is a domain in RN with a compact boundary and f a continuous increasing function satisfying super linear growth condition. We
Results 1  10
of
11,186