Search references for SEPARABILITY PROBLEM. Phrases containing SEPARABILITY PROBLEM
See searches and references containing SEPARABILITY PROBLEM!SEPARABILITY PROBLEM
The separability problem is a concept from the field of social choice theory that describes the situation where two or more issues up for vote on a ballot
Separability_problem
Quantum states that are not entangled
criterion is actually a necessary and sufficient condition for separability. Other separability criteria include (but not limited to) the range criterion,
Separable_state
Direct vote on a specific proposal
referendum attack the use of closed questions. A difficulty called the separability problem can plague a referendum on two or more issues. If one issue is in
Referendum
Type of algebraic field extension
field is separable. It follows that most extensions that are considered in mathematics are separable. Nevertheless, the concept of separability is important
Separable_extension
first-order theory is separably closed. The stable forking conjecture for simple theories Tarski's exponential function problem: is the theory of the
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Algorithm for supervised learning of binary classifiers
(prior) knowledge of linear separability of the data set. In the linearly separable case, it will solve the training problem – if desired, even with optimal
Perceptron
Geometric property of a pair of sets of points in Euclidean geometry
In Euclidean geometry, linear separability is a property of two sets of points. This is most easily visualized in two dimensions (the Euclidean plane)
Linear_separability
Partially unsolved problem in mathematics
that acts on a Banach space that is not isomorphic to a separable Hilbert space). The problem seems to have been stated in the mid-20th century after
Invariant_subspace_problem
Physics phenomenon
criterion is merely a necessary one for separability, as the problem becomes NP-hard when generalized. Other separability criteria include (but not limited
Quantum_entanglement
Class of algorithms for solving constrained optimization problems
is separable in x and y. The dual update requires solving a proximity function in x and y at the same time; the ADMM technique allows this problem to
Augmented_Lagrangian_method
Study of optimal transportation and allocation of resources
to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781. In the
Transportation theory (mathematics)
Transportation_theory_(mathematics)
French mathematician (born 1944)
x_{N})=\sum _{n}f_{n}(x_{n}).} For example, problems of linear optimization are separable. For a separable problem, we consider an optimal solution x min =
Ivar_Ekeland
Problem in physics and astronomy
In physics and astronomy, Euler's three-body problem is to solve for the motion of a particle that is acted upon by the gravitational field of two other
Euler's_three-body_problem
Philosophical question
The problem of universals is an ancient question from metaphysics that has inspired a range of philosophical topics and disputes: "Should the properties
Problem_of_universals
Legal concept regulating rights of a creative work
A copyright is a type of intellectual property that gives its owner the exclusive legal right to copy, distribute, adapt, display, and perform a creative
Copyright
Technique for solving differential equations
differential equation for the unknown f ( x ) {\displaystyle f(x)} is separable if it can be written in the form d d x f ( x ) = g ( x ) h ( f ( x ) )
Separation_of_variables
Class of ordinary differential equations
applied mathematics, where Sturm–Liouville problems occur very frequently, particularly when dealing with separable linear partial differential equations.
Sturm–Liouville_theory
Sums of sets of vectors are nearly convex
large and separable problems, despite the non-convexities of the summand functions. Ekeland and later authors argued that additive separability produced
Shapley–Folkman_lemma
Method of analyzing variables in software
locally separable problems. Such problems have generic polynomial-time solutions. In addition to the reaching definitions and live variables problems mentioned
Data-flow_analysis
Unique extension of pure states in Hilbert spaces
In mathematics, the Kadison–Singer problem, posed in 1959, was a problem in functional analysis about whether certain extensions of certain linear functionals
Kadison–Singer_problem
Robotics problem on coordinating two parts of a robot
different methods and solutions developed to solve the problem, broadly defined as either separable, simultaneous solutions. Each type of solution has specific
Hand–eye_calibration_problem
(not necessarily separable) Hilbert space. The problem has been solved in the affirmative for special cases (specifically for separable and Type-I C*-algebras)
Naimark's_problem
Necessary condition for optimality associated with dynamic programming
that if the cost function of the multi-stage optimization problem satisfies a "backward separable" structure, then the appropriate Bellman equation can be
Bellman_equation
Social choice problem
around. This problem is called non-separability. There are several approaches for eliciting voters' preferences when they are not separable: If there are
Multi-issue_voting
The SR1 method has computational advantages for sparse or partially separable problems. A twice continuously differentiable function x ↦ f ( x ) {\displaystyle
Symmetric_rank-one
Computational model used in machine learning
single-layer perceptrons, which were restricted to solving linearly separable problems. These limitations were highlighted in the book Perceptrons by Marvin
Neural network (machine learning)
Neural_network_(machine_learning)
should not be confused with the case of a separable ODE, which refers to a somewhat different class of problems that can be broken into a pair of integrals;
Separable partial differential equation
Separable_partial_differential_equation
Class of economic models
the assumption of weak separability, under which groups of goods or inputs can be treated as composite aggregates. Separability allows a high-dimensional
Computable general equilibrium
Computable_general_equilibrium
Improvement of the coordinate descent algorithm
extend the coordinate descent method (c) to the optimization of non-separable problems (d). The adaptation of an appropriate coordinate system allows adaptive
Adaptive_coordinate_descent
Millennium Prize Problem
existence and mass gap problem is an unsolved problem in mathematical physics and mathematics, and one of the seven Millennium Prize Problems defined by the Clay
Yang–Mills existence and mass gap
Yang–Mills_existence_and_mass_gap
On invertibility of polynomial maps (mathematics)
MR 1352692 Wang, Stuart Sui-Sheng (August 1980), "A Jacobian criterion for separability", Journal of Algebra, 65 (2): 453–494, doi:10.1016/0021-8693(80)90233-1
Jacobian_conjecture
Problem in set theory
In mathematics, Suslin's problem is a question about totally ordered sets posed by Mikhail Yakovlevich Suslin (1920) and published posthumously. It has
Suslin's_problem
Class of problems in classical mechanics
In classical mechanics, the central-force problem is to determine the motion of a particle in a single central potential field. A central force is a force
Classical central-force problem
Classical_central-force_problem
Ability to make choices voluntarily
"Intricately related to the hard problem of consciousness, the hard problem of free will represents the core problem of conscious free will: Does conscious
Free_will
Mathematical problem in von Neumann algebra theory
conjecture in C*-algebra theory Tsirelson's problem in quantum information theory The predual of any (separable) von Neumann algebra is finitely representable
Connes_embedding_problem
Type of vector space in math
separable Hilbert spaces are therefore isometrically isomorphic to the square-summable sequence space, ℓ 2 . {\displaystyle \ell ^{2}.} Separability was
Hilbert_space
Mathematical game of resource allocation
The Kolkata Paise Restaurant Problem (KPR Problem) is a mathematical game for competitive resource allocation without any coordination. Its name is drawn
Kolkata Paise Restaurant Problem
Kolkata_Paise_Restaurant_Problem
Difficulties arising when analyzing data with many aspects ("dimensions")
One example of the blessing of dimensionality phenomenon is linear separability of a random point from a large finite random set with high probability
Curse_of_dimensionality
Mathematical model to assist inventory levels
the Morse and Kimball (1951)'s book. The problem was termed the "Christmas tree problem" and "newsboy problem" in the 1960s and 1970s, and beginning in
Newsvendor_model
Thought experiment in quantum mechanics
point of contact. The EPR paper concludes with a claim that this lack of separability meant that quantum mechanics as a theory of reality was incomplete. Schrödinger
Schrödinger's_cat
School of thought of philosophy of law and jurisprudence
teachings of the empiricists preceded systemization of a positivist method for problems of comprehension and analysis, which was later represented by legal positivism
Legal_positivism
Nonparametric spectral estimation method
separable as N → ∞ {\displaystyle N\rightarrow \infty } . In practice N {\displaystyle N} is fixed and one is interested in approximate separability between
Singular_spectrum_analysis
Collection of random variables
space. The concept of separability of a stochastic process was introduced by Joseph Doob. The underlying idea of separability is to make a countable
Stochastic_process
Italian mathematician (1873–1941)
celestial mechanics (notably on the three-body problem), analytic mechanics (the Levi-Civita separability conditions in the Hamilton–Jacobi equation) and
Tullio_Levi-Civita
Term in mathematics
bundle is trivial. This is related to the solution of the second Cousin problem. The standard complex space C n {\displaystyle \mathbb {C} ^{n}} is a Stein
Stein_manifold
French applied mathematician
commitment problems"), where nonconvexity appears because of integer constraints: Bertsekas, Dimitri P. (1982). "5.6 Large scale separable integer programming
Claude_Lemaréchal
Neural network technology
Depthwise separable convolution separates the standard convolution into two steps: depthwise convolution and pointwise convolution. The depthwise separable convolution
Convolutional_layer
Hypersurface used by a classification algorithm
maximum margin. If the problem is not originally linearly separable, the kernel trick can be used to turn it into a linearly separable one, by increasing
Decision_boundary
time whether a given separable permutation is a pattern in a larger permutation, in contrast to the same problem for non-separable permutations, which
Separable_permutation
Technique in numerical linear algebra
V. Pereyra, Separable nonlinear least squares: the variable projection method and its applications, Institute of Physics, Inverse Problems, Volume 19,
Low-rank_approximation
as a series of separable potentials. The Coulomb interaction between two protons is a special problem, in that its expansion in separable potentials does
Faddeev_equations
of unsolved problems about them. Any open subset of a cosmic space is cosmic since open subsets of separable spaces are separable. Separable metric spaces
Cosmic_space
Conjecture in graph theory
Unsolved problem in mathematics Are graphs uniquely determined by their subgraphs? More unsolved problems in mathematics In graph theory, informally, the
Reconstruction_conjecture
Process by which a quantum system takes on a definitive state
result in one definite outcome. This difference is called the measurement problem of quantum mechanics. To predict measurement outcomes from quantum solutions
Wave_function_collapse
Book by Marvin Minsky and Seymour Papert
the XOR function, and also the important connectedness predicate. The problem of connectedness is illustrated at the awkwardly colored cover of the book
Perceptrons_(book)
Process in machine learning and statistics
information; see here. Other available filter metrics include: Class separability Error probability Inter-class distance Probabilistic distance Entropy
Feature_selection
2017 United States Supreme Court case
articles" can be restricted by copyright law. The Court created a two-prong "separability" test, granting copyrightability based on separate identification and
Star Athletica, LLC v. Varsity Brands, Inc.
Star_Athletica,_LLC_v._Varsity_Brands,_Inc.
Description of physical properties at the atomic and subatomic scale
1007/s10701-009-9347-0. S2CID 32755624. Howard, D. (1985). "Einstein on locality and separability". Studies in History and Philosophy of Science Part A. 16 (3): 171–201
Quantum_mechanics
Process of producing small rectangular items of fixed dimensions
Madhusudhan Reddy (2020). Byrka, Jaros\law; Meka, Raghu (eds.). "On Guillotine Separability of Squares and Rectangles". Approximation, Randomization, and Combinatorial
Guillotine_cutting
Method of solving differential equations
arbitrary regions and boundary conditions. They do not depend on the separability of the equations or other special properties of the equation. They have
Multigrid_method
mathematics, a logical matrix may be described as d-disjunct and/or d-separable. These concepts play a pivotal role in the mathematical area of non-adaptive
Disjunct_matrix
Measure defined on all open sets of a topological space
the Hamburger moment problem, the Stieltjes moment problem and the Hausdorff moment problem, respectively. The question or problem to be solved is, given
Borel_measure
Special case of the Euler-Lagrange equations
example of an application of the Beltrami identity is the brachistochrone problem, which involves finding the curve y = y ( x ) {\displaystyle y=y(x)} that
Beltrami_identity
Basic concept of graph theory
isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience
Connectivity_(graph_theory)
distortion problem is now primarily of interest on the spaces ℓp, all of which are separable and uniform convex, for 1 < p < ∞. In separable and uniform
Distortion_problem
Mathematical connection between field theory and group theory
connection, the fundamental theorem of Galois theory, allows reducing certain problems in field theory to group theory, which makes them simpler and easier to
Galois_theory
Measure of the shape of a function
the distribution (Hausdorff moment problem). The same is not true on unbounded intervals (Hamburger moment problem). In the mid-nineteenth century, Pafnuty
Moment_(mathematics)
Concept in topology
the mathematical discipline of general topology, a Polish space is a separable completely metrizable topological space; that is, a space homeomorphic
Polish_space
Differential equation exhibiting high rate of dissipation
In computational mathematics, a stiff equation is an initial value problem u ˙ = f ( u ) , u ( 0 ) = u 0 , t ∈ [ 0 , T ] , {\displaystyle {\dot {u}}=f(u)\
Stiff_equation
The real numbers or their cardinality
y ∈ C such that x < y, then there exists z ∈ S such that x < z < y. (separability axiom) C has no first element and no last element. (Unboundedness axiom)
Continuum_(set_theory)
Theoretical framework in physics
and persistence of various infinities in perturbative calculations, a problem only resolved in the 1950s with the invention of the renormalization procedure
Quantum_field_theory
Family of solutions to related differential equations
Bessel functions are a class of special functions that commonly appear in problems involving wave motion, heat conduction, and other physical phenomena with
Bessel_function
Distance function defined between probability distributions
that needs to be moved times the mean distance it has to be moved. This problem was first formalised by Gaspard Monge in 1781. Because of this analogy
Wasserstein_metric
unified transform, is an algorithmic procedure for analysing boundary value problems for linear partial differential equations and for an important class of
Fokas_method
Mathematical concept
(1973). "P. Enflo solved in the negative Banach's problem on the existence of a basis for every separable Banach space". Fiz.-Mat. Spis. Bulgar. Akad. Nauk
Approximation_property
Matrix decomposition
the time modulation (or vice versa). One may then define an index of separability α = σ 1 2 ∑ i σ i 2 , {\displaystyle \alpha ={\frac {\sigma _{1}^{2}}{\sum
Singular_value_decomposition
Feature of systems that defy description
classes, the separability of the classes, and measures of geometry, topology, and density of manifolds. For non-binary classification problems, instance
Complexity
Upper bound in coding theory
achieve equality in the Singleton bound are called MDS (maximum distance separable) codes. Examples of such codes include codes that have only q {\displaystyle
Singleton_bound
Problem on words in group theory
In abstract algebra, the conjugacy problem for a group G with a given presentation is the decision problem of determining, given two words x and y in
Conjugacy_problem
1967 U.S. Supreme Court case on arbitration
processes and separability fosters cynicism and distrust in the rule of law, undermining its legitimacy." Defenders of the decision and separability have said
Prima Paint Corp. v. Flood & Conklin Manufacturing Co.
Prima_Paint_Corp._v._Flood_&_Conklin_Manufacturing_Co.
Abelian group related to division algebras
to a tensor product of cyclic algebras of degree p. It is a major open problem (raised by Albert) whether every division algebra of prime degree over
Brauer_group
Numerical integration scheme for Hamiltonian systems
long-term evolution of chaotic Hamiltonian systems ranging from the Kepler problem to the classical and semi-classical simulations in molecular dynamics.
Symplectic_integrator
Type of mathematical functions
meromorphic functions, i.e. the problem of creating a global meromorphic function from zeros and poles, is called the Cousin problem. Also, the interesting phenomena
Function of several complex variables
Function_of_several_complex_variables
Topological space that is homeomorphic to a metric space
second-countable. Urysohn's Theorem can be restated as: A topological space is separable and metrizable if and only if it is regular, Hausdorff and second-countable
Metrizable_space
Galois group of the separable closure
{\displaystyle K} , where K sep {\displaystyle K^{\textrm {sep}}} is a separable closure of K {\displaystyle K} . Alternatively, it is the group of all
Absolute_Galois_group
State or quality of being bodiless
incorporeal if it is not made out of matter. In the problem of universals, universals are separable from any particular embodiment in one sense, while
Incorporeality
Probability distribution of energy states of a system
state, among the collection. The canonical ensemble has the property of separability when applied to such a collection: as long as the non-interacting subsystems
Boltzmann_distribution
Set of methods for supervised statistical learning
the original problem may be stated in a finite-dimensional space, it often happens that the sets to discriminate are not linearly separable in that space
Support_vector_machine
Differential equation containing derivatives with respect to only one variable
computing the Taylor series of the solutions may be useful. For applied problems, numerical methods for ordinary differential equations can supply an approximation
Ordinary differential equation
Ordinary_differential_equation
{\displaystyle \displaystyle {f_{x,y}(g)=(T_{g}^{-1}x,T_{g}^{-1}y),}} generate a separable unital C* subalgebra A of the uniformly bounded continuous functions on
Uniformly bounded representation
Uniformly_bounded_representation
Optimization problem in mathematics
Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large
Rectangle_packing
Solving multiple machine learning tasks at the same time
matrices}}\}\subset \mathbb {R} ^{T\times T}} . This factorization property, separability, implies the input feature space representation does not vary by task
Multi-task_learning
Statistics dataset
Fisher in his 1936 paper The use of multiple measurements in taxonomic problems as an example of linear discriminant analysis. It is sometimes called Anderson's
Iris_flower_data_set
Map of history from Big Bang to present
relation to the known. It achieves this novel accomplishment by solving the problem of psychology and giving rise to a truly consilient view of the scientific
Tree_of_knowledge_system
Statement in computational learning theory
complex pattern-classification problem, cast in a high-dimensional space nonlinearly, is more likely to be linearly separable than in a low-dimensional space
Cover's_theorem
Eigenvalue problem for the Laplace operator
ISBN 978-0-8194-9957-8. Engquist, Björn; Zhao, Hongkai (2018). "Approximate separability of the Green's function of the Helmholtz equation in the high frequency
Helmholtz_equation
Type of feedforward neural network
layers, notable for being able to distinguish data that is not linearly separable. Modern neural networks are trained using backpropagation and are colloquially
Multilayer_perceptron
Economic concept proposed by Erik Lindahl
setting with only public goods. This is a special case of the free-rider problem. Fain, Goel and Mungala present an algorithm for computing the Lindahl
Lindahl_tax
Subspace preserved by a linear mapping
problem concerns the case where V is a separable Hilbert space over the complex numbers, of dimension > 1, and T is a bounded operator. The problem is
Invariant_subspace
Unrecoverable cost that has been incurred
The bygones principle can also be formalised as the notion of "separability". Separability requires agents to take decisions by comparing the available
Sunk_cost
SEPARABILITY PROBLEM
SEPARABILITY PROBLEM
Boy/Male
Arabic, Indian, Muslim
Problem Solver
Girl/Female
Indian, Telugu
Destroyer of Problems
Girl/Female
Muslim/Islamic
Away from all Problems
Girl/Female
Bengali, Indian
Eternity; Problem Solver
Boy/Male
Indian, Tamil
People with this Name are Preferably Intelligent and Very Generous; Highly Knowledgeable in Problem Solving Skills
Boy/Male
Muslim
Problem solver
Boy/Male
Hindu, Indian
Problem
SEPARABILITY PROBLEM
SEPARABILITY PROBLEM
Girl/Female
Australian, German
Man
Boy/Male
Indian, Kashmiri, Sanskrit
Knower of Meaning; Knowing; Sound; Reader
Girl/Female
Australian, Christian, Latin
Flower Name
Boy/Male
Celtic
Son of Egan.
Boy/Male
Bengali, Indian, Modern
Prosperous
Girl/Female
Scottish
From the French 'bon' meaning good. In Scottish usage 'bonnie' means pretty or charming.
Girl/Female
French, German, Greek, Hungarian, Latin, Polish
Violet Blossom; Purple; Violet Flower
Boy/Male
British, English
From the Ox Farm
Male
English
Anglicized form of Hebrew Chiy'el, HIEL means "God lives." In the bible, this is the name of one of the rebuilders of Jericho.
Boy/Male
American, Australian, French, German, Latin, Scandinavian
Stern; Strict; Reddish Brown Hair; Thunder
SEPARABILITY PROBLEM
SEPARABILITY PROBLEM
SEPARABILITY PROBLEM
SEPARABILITY PROBLEM
SEPARABILITY PROBLEM
v. t.
To explain; to resolve; to unfold; to clear up (what is obscure or difficult to be understood); to work out to a result or conclusion; as, to solve a doubt; to solve difficulties; to solve a problem.
n.
The state or property of being indivisible or inseparable; inseparability.
n.
The quality or state of being partible; divisibility; separability; as, the partibility of an inherttance.
n.
Quality of being separable or divisible; divisibility; separableness.
a.
Questionable; equivocal; indefinite; problematical.
n.
A problem of more than usual difficulty added to another on an examination paper.
n.
The act of solving, or the state of being solved; the disentanglement of any intricate problem or difficult question; explanation; clearing up; -- used especially in mathematics, either of the process of solving an equation or problem, or the result of the process.
v. t.
To have just and adequate ideas of; to apprehended the meaning or intention of; to have knowledge of; to comprehend; to know; as, to understand a problem in Euclid; to understand a proposition or a declaration; the court understands the advocate or his argument; to understand the sacred oracles; to understand a nod or a wink.
n.
The quality or state of being inseparable; inseparability.
n.
To cause to stick; to bring to a stand; to pose; to puzzle; as, to stick one with a hard problem.
v. t.
To propose problems.
n.
One who proposes problems.
n.
The quality or state of being inseparable; inseparableness.
n.
A problem to be solved, or an example to be wrought out.
n.
The quality or state of being solvable; as, the solvability of a difficulty; the solvability of a problem.
n.
A certain function relating to a system of forces and their points of application, -- first used by Clausius in the investigation of problems in molecular physics.
n.
To begin to deal with; as, to tackle the problem.
a.
Having the nature of a problem; not shown in fact; questionable; uncertain; unsettled; doubtful.
n.
The quality or state of being reparable.
a.
Alt. of Problematical