Results 1  10
of
1,253,036
Surface reconstruction from unorganized points
 COMPUTER GRAPHICS (SIGGRAPH ’92 PROCEEDINGS)
, 1992
"... We describe and demonstrate an algorithm that takes as input an unorganized set of points fx1�:::�xng IR 3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be know ..."
Abstract

Cited by 815 (8 self)
 Add to MetaCart
to be known in advance — all are inferred automatically from the data. This problem naturally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from twodimensional slices, and interactive surface sketching.
Registration of Multiple Point Sets
 Proc. 13 th Int. Conf. on Pattern Recognition
, 1996
"... Registering 3D point sets subject to rigid body motion is a common problem in computer vision. The optimal transformation is usually specified to be the minimum of a weighted least squares cost. The case of 2 point sets has been solved by several authors using analytic methods such as SVD. In this p ..."
Abstract

Cited by 67 (1 self)
 Add to MetaCart
Registering 3D point sets subject to rigid body motion is a common problem in computer vision. The optimal transformation is usually specified to be the minimum of a weighted least squares cost. The case of 2 point sets has been solved by several authors using analytic methods such as SVD
Diversity and Multiplexing: A Fundamental Tradeoff in Multiple Antenna Channels
 IEEE Trans. Inform. Theory
, 2002
"... Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. In this paper, we propose the point of view that both types of gains can be simultaneously obtained for a given multiple antenna channel, but there is a fund ..."
Abstract

Cited by 1165 (20 self)
 Add to MetaCart
Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. In this paper, we propose the point of view that both types of gains can be simultaneously obtained for a given multiple antenna channel, but there is a
MAFFT version 5: improvement in accuracy of multiple sequence alignment
 NUCLEIC ACIDS RES
, 2005
"... The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed high ..."
Abstract

Cited by 801 (5 self)
 Add to MetaCart
the effect of the number of homologues included in an alignment. For a multiple alignment consisting of 8 sequences with low similarity, the accuracy was improved (2–10 percentage points) when the sequences were aligned together with dozens of their close homologues (Evalue, 105–1020) collected from a
Fast Multiple Point . . .
"... Multiplepoint multiplication on elliptic curves is the highest computational complex operation in the elliptic curve cyptographic based digital signature schemes. We describe three algorithms for multiplepoint multiplication on elliptic curves over prime and binary fields, based on the representat ..."
Abstract
 Add to MetaCart
Multiplepoint multiplication on elliptic curves is the highest computational complex operation in the elliptic curve cyptographic based digital signature schemes. We describe three algorithms for multiplepoint multiplication on elliptic curves over prime and binary fields, based
Capacity of a Mobile MultipleAntenna Communication Link in Rayleigh Flat Fading
"... We analyze a mobile wireless link comprising M transmitter and N receiver antennas operating in a Rayleigh flatfading environment. The propagation coefficients between every pair of transmitter and receiver antennas are statistically independent and unknown; they remain constant for a coherence int ..."
Abstract

Cited by 495 (22 self)
 Add to MetaCart
interval of T symbol periods, after which they change to new independent values which they maintain for another T symbol periods, and so on. Computing the link capacity, associated with channel coding over multiple fading intervals, requires an optimization over the joint density of T M complex transmitted
ON THE MULTIPLE POINTS OF RANDOM WALKS
"... Let {Sn}∞n=0 be a random walk on Zd starting at the rogin. The pmultiple point range at time n of the random walk, denoted by Q(p)n, means the number of distinct points entered exactly p times by the random walk in the first n steps. If the random walk is transient, Pitt proved that Q(p)n obeys the ..."
Abstract
 Add to MetaCart
Let {Sn}∞n=0 be a random walk on Zd starting at the rogin. The pmultiple point range at time n of the random walk, denoted by Q(p)n, means the number of distinct points entered exactly p times by the random walk in the first n steps. If the random walk is transient, Pitt proved that Q(p)n obeys
The Multiple Point Principle and Higgs
, 2004
"... The multiple point principle (MPP), according to which several vacuum states with the same energy density exist, is put forward as a finetuning mechanism predicting the ratio between the fundamental and weak scales in the Standard Model (SM) and in its two Higgs doublet extension (2HDM). Using reno ..."
Abstract
 Add to MetaCart
The multiple point principle (MPP), according to which several vacuum states with the same energy density exist, is put forward as a finetuning mechanism predicting the ratio between the fundamental and weak scales in the Standard Model (SM) and in its two Higgs doublet extension (2HDM). Using
Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
 Evolutionary Computation
, 1994
"... In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about t ..."
Abstract

Cited by 539 (5 self)
 Add to MetaCart
sorting in GAs along with a niche and speciation method to find multiple Paretooptimal points sim...
On the algorithmic implementation of multiclass kernelbased vector machines
 Journal of Machine Learning Research
"... In this paper we describe the algorithmic implementation of multiclass kernelbased vector machines. Our starting point is a generalized notion of the margin to multiclass problems. Using this notion we cast multiclass categorization problems as a constrained optimization problem with a quadratic ob ..."
Abstract

Cited by 559 (13 self)
 Add to MetaCart
to incorporate kernels with a compact set of constraints and decompose the dual problem into multiple optimization problems of reduced size. We describe an efficient fixedpoint algorithm for solving the reduced optimization problems and prove its convergence. We then discuss technical details that yield
Results 1  10
of
1,253,036