Results 1  10
of
4,346,449
An inventory for measuring clinical anxiety: Psychometric properties
 JOURNAL OF CONSULTING AND CLINICAL PSYCHOLOGY
, 1988
"... The development of a 2 litem selfreport inventory for measuring the severity of anxiety in psychiaric populations i described. The initial item pool f86 items was drawn from three preexisting scales: the Anxiety Checklist, the Physician's Desk Reference Checklist, and the Situational Anxiety ..."
Abstract

Cited by 727 (1 self)
 Add to MetaCart
(l 53) =.25. Studies addressing the distinctiveness of anxiety and depression depend on the availability of reliable and valid assessment instruments. However, a number of studies have reported high correlations (r>.50) between the widely used rating scales of anxiety and depression (e.g., Dobson
RealTime Systems
, 2000
"... Collision avoidance is an important topic in multirobot systems. Existing multirobot pathfinding approaches ignore sideswipe collisions among robots (i.e., only consider the collision which two agents try to occupy the same node during the same timestep) [1, 3, 4], and allow diagonal move between ..."
Abstract

Cited by 589 (11 self)
 Add to MetaCart
between two adjacent nodes (e.g., Figure 1(b)). However, in many real world applications, sideswipe collisions may also block robots ’ movements or cause deadlocks. For example, as shown in Figure 1, if the size of two robots is as big as the grid size they occupied, collisions will happen not only
Computing semantic relatedness using Wikipediabased explicit semantic analysis
 In Proceedings of the 20th International Joint Conference on Artificial Intelligence
, 2007
"... Computing semantic relatedness of natural language texts requires access to vast amounts of commonsense and domainspecific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a highdimensional space of concepts derived from Wikipedi ..."
Abstract

Cited by 545 (9 self)
 Add to MetaCart
Wikipedia. We use machine learning techniques to explicitly represent the meaning of any text as a weighted vector of Wikipediabased concepts. Assessing the relatedness of texts in this space amounts to comparing the corresponding vectors using conventional metrics (e.g., cosine). Compared
Secure Group Communications Using Key Graphs
 SIGCOMM '98
, 1998
"... Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract

Cited by 545 (17 self)
 Add to MetaCart
Many emerging applications (e.g., teleconference, realtime information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number
Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition
 in Conference Record of The TwentySeventh Asilomar Conference on Signals, Systems and Computers
, 1993
"... In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang (199 ..."
Abstract

Cited by 622 (1 self)
 Add to MetaCart
In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. aiEne (wa.velet) frames. We propoeea modification to the Matching Pursuit algorithm of Mallat and Zhang
An iterative image registration technique with an application to stereo vision
 In IJCAI81
, 1981
"... Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton ..."
Abstract

Cited by 2859 (29 self)
 Add to MetaCart
of the difference between F(x + h) and G(x), for x in some region of interest R. (See figure 1). 1.
Numerical solution of initial boundary value problems involving Maxwell’s equations in isotropic media
 IEEE Trans. Antennas and Propagation
, 1966
"... The characteristics of the waves guided along a plane [I] P. S. Epstein, “On the possibility of electromagnetic surface waves, ” Proc. Nat’l dcad. Sciences, vol. 40, pp. 11581165, Deinterface which separates a semiinfinite region of free cember 1954. space from that of a magnetoionic medium are in ..."
Abstract

Cited by 1014 (0 self)
 Add to MetaCart
plane interface between an isotropic and a gyrotropic dielectric,” we and 1/42 times the upper hybrid resonant frequency. Canad. J. Phys., vol. 42, pp. 21532172, November 1964. The surface waves propagate with a phase velocity [5] G. H. Owpang and S. R. Seshadri, “Guided waves propagating along
The irreducibility of the space of curves of given genus
 Publ. Math. IHES
, 1969
"... Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k ~ ..."
Abstract

Cited by 504 (2 self)
 Add to MetaCart
Fix an algebraically closed field k. Let Mg be the moduli space of curves of genus g over k. The main result of this note is that Mg is irreducible for every k. Of course, whether or not M s is irreducible depends only on the characteristic of k. When the characteristic s o, we can assume that k
Decoding by Linear Programming
, 2004
"... This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to rec ..."
Abstract

Cited by 1371 (16 self)
 Add to MetaCart
to recover f exactly from the data y? We prove that under suitable conditions on the coding matrix A, the input f is the unique solution to the ℓ1minimization problem (‖x‖ℓ1:= i xi) min g∈R n ‖y − Ag‖ℓ1 provided that the support of the vector of errors is not too large, ‖e‖ℓ0: = {i: ei ̸= 0}  ≤ ρ · m
Grounding in communication
 In
, 1991
"... We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let ..."
Abstract

Cited by 1088 (19 self)
 Add to MetaCart
We give a general analysis of a class of pairs of positive selfadjoint operators A and B for which A + XB has a limit (in strong resolvent sense) as h10 which is an operator A, # A! Recently, Klauder [4] has discussed the following example: Let A be the operator(d2/A2) + x2 on L2(R, dx) and let
Results 1  10
of
4,346,449