Results 1  10
of
8,103
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 683 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
DIRECT METHODS OF SOLVING PHASE AMBIGUITIES IN MACRO MOLECULAR STRUCTURES
"... h the reciprocallattice vector, which corresponds to the diffraction index hkl Fh the structure factor at the reciprocallattice node defined by h Fh the magnitude of Fh ϕh the phase of Fh Eh the normalised structure factor corresponding to Fh Eh the magnitude of Eh F o h the structurefactor contr ..."
Abstract
 Add to MetaCart
h the reciprocallattice vector, which corresponds to the diffraction index hkl Fh the structure factor at the reciprocallattice node defined by h Fh the magnitude of Fh ϕh the phase of Fh Eh the normalised structure factor corresponding to Fh Eh the magnitude of Eh F o h the structure
Joint Scheduling and Power Control for Wireless Adhoc Networks
, 2002
"... In this pape we introduce powe r control as a solution tothe multiple accel proble in conte tionbase wirenb adhocne works.The motivation for this study is two fold, limiting multiuse intej toincre single hop throughput, andrej powe r consumption to increj batte life We focus onne ne bor transmi ..."
Abstract

Cited by 283 (6 self)
 Add to MetaCart
transmissions whes node are rej tose information packe  tothe re e e re e sub jej to a constraint on the signaltointealtoinjj ratio.The multiple acce  proble is solve via twoaltej phase name schej and powe r control.The sche algorithm isej tial to coordinate the transmissions ofinde ede t use inorde
Solving phasenoise FokkerPlanck equations using the motiongroup Fourier transform
 IEEE Transactions on Communications
, 2006
"... Abstract—A quantity of importance in coherent optical communications is the probability density of a filtered signal in the presence of phase noise (PN). The Fokker–Planck (FP) approach has been recognized as a rigorous way to describe these statistical properties. However, computational difficultie ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract—A quantity of importance in coherent optical communications is the probability density of a filtered signal in the presence of phase noise (PN). The Fokker–Planck (FP) approach has been recognized as a rigorous way to describe these statistical properties. However, computational
Solving PhaseLift by lowrank Riemannian optimization methods for complex semidefinite constraints
"... ..."
Phase Noise in Oscillators: a Unifying Theory and Numerical Methods for Characterization
 IEEE Transactions on Circuits and Systems
, 2000
"... Abstract—Phase noise is a topic of theoretical and practical interest in electronic circuits, as well as in other fields, such as optics. Although progress has been made in understanding the phenomenon, there still remain significant gaps, both in its fundamental theory and in numerical techniques f ..."
Abstract

Cited by 235 (27 self)
 Add to MetaCart
obtain an exact nonlinear equation for phase error, which we solve without approximations for random perturbations. This leads us to a precise characterization of timing jitter and spectral dispersion, for computing which we develop efficient numerical methods. We demonstrate our techniques on a variety
Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit
, 2006
"... Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NPhard in general. We show here that for systems with ‘typical’/‘random ’ Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our pr ..."
Abstract

Cited by 274 (22 self)
 Add to MetaCart
enters per stage in OMP; and StOMP takes a fixed number of stages (e.g. 10), while OMP can take many (e.g. n). StOMP runs much faster than competing proposals for sparse solutions, such as ℓ1 minimization and OMP, and so is attractive for solving largescale problems. We use phase diagrams to compare
Genetic Algorithms, Noise, and the Sizing of Populations
 COMPLEX SYSTEMS
, 1991
"... This paper considers the effect of stochasticity on the quality of convergence of genetic algorithms (GAs). In many problems, the variance of buildingblock fitness or socalled collateral noise is the major source of variance, and a populationsizing equation is derived to ensure that average sig ..."
Abstract

Cited by 276 (85 self)
 Add to MetaCart
signaltocollateralnoise ratios are favorable to the discrimination of the best building blocks required to solve a problem of bounded deception. The sizing relation is modified to permit the inclusion of other sources of stochasticity, such as the noise of selection, the noise of genetic operators
Scalable Algorithms for Association Mining
 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
, 2000
"... Association rule discovery has emerged as an important problem in knowledge discovery and data mining. The association mining task consists of identifying the frequent itemsets, and then forming conditional implication rules among them. In this paper we present efficient algorithms for the discovery ..."
Abstract

Cited by 259 (23 self)
 Add to MetaCart
for the discovery of frequent itemsets, which forms the compute intensive phase of the task. The algorithms utilize the structural properties of frequent itemsets to facilitate fast discovery. The items are organized into a subset lattice search space, which is decomposed into small independent chunks or sub
A Nonlinear PrimalDual Method For Total VariationBased Image Restoration
, 1995
"... . We present a new method for solving total variation (TV) minimization problems in image restoration. The main idea is to remove some of the singularity caused by the nondifferentiability of the quantity jruj in the definition of the TVnorm before we apply a linearization technique such as Newton ..."
Abstract

Cited by 232 (22 self)
 Add to MetaCart
. We present a new method for solving total variation (TV) minimization problems in image restoration. The main idea is to remove some of the singularity caused by the nondifferentiability of the quantity jruj in the definition of the TVnorm before we apply a linearization technique
Results 1  10
of
8,103