Results 1  10
of
7,826
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
as the class F of those elements whose entries obey the power decay law f  (n) ≤ C · n −1/p. We take measurements 〈f, Xk〉, k = 1,..., K, where the Xk are Ndimensional Gaussian
An inventory for measuring depression
 Archives of General Psychiatry
, 1961
"... The difficulties inherent in obtaining consistent and adequate diagnoses for the purposes of research and therapy have been pointed out by a number of authors. Pasamanick12 in a recent article viewed the low interclinician agreement on diagnosis as an indictment of the present state of psychiatry ..."
Abstract

Cited by 1195 (0 self)
 Add to MetaCart
to objective measurement have resulted in a wide variety of psychiatric rating ~ c a l e s. ~ J ~ These have been well summarized in a review article by Lorr l1 on "Rating Scales and Check Lists for the E v a 1 u a t i o n of Psychopathology. " In the area of psychological testing, a
The homogeneous coordinate ring of a toric variety
, 1992
"... This paper will introduce the homogeneous coordinate ring S of a toric variety X. The ring S is a polynomial ring with one variable for each onedimensional cone in the fan ∆ determining X, and S has a natural grading determined by the monoid of effective divisor classes in the Chow group An−1(X) of ..."
Abstract

Cited by 474 (7 self)
 Add to MetaCart
sheaves on X. We also define a monomial ideal B ⊂ S that describes the combinatorial structure of the fan ∆. In the case of projective space, the ring S is just the usual homogeneous coordinate ring C[x0,..., xn], and the ideal B is the “irrelevant ” ideal 〈x0,..., xn〉. Projective space P n can
Dual polyhedra and mirror symmetry for Calabi–Yau hypersurfaces in toric varieties
 J. Alg. Geom
, 1994
"... We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined by ..."
Abstract

Cited by 467 (20 self)
 Add to MetaCart
We consider families F(∆) consisting of complex (n − 1)dimensional projective algebraic compactifications of ∆regular affine hypersurfaces Zf defined by Laurent polynomials f with a fixed ndimensional Newton polyhedron ∆ in ndimensional algebraic torus T = (C ∗ ) n. If the family F(∆) defined
Approximation Algorithms for Projective Clustering
 Proceedings of the ACM SIGMOD International Conference on Management of data, Philadelphia
, 2000
"... We consider the following two instances of the projective clustering problem: Given a set S of n points in R d and an integer k ? 0; cover S by k hyperstrips (resp. hypercylinders) so that the maximum width of a hyperstrip (resp., the maximum diameter of a hypercylinder) is minimized. Let w ..."
Abstract

Cited by 302 (22 self)
 Add to MetaCart
results related to projective clustering: (i) For d = 2, we present a randomized algorithm that computes O(k log k) strips of width at most 6w that cover S. Its expected running time is O(nk 2 log 4 n) if k 2 log k n; it also works for larger values of k, but then the expected running time is O(n
On Projection Algorithms for Solving Convex Feasibility Problems
, 1996
"... Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of the ..."
Abstract

Cited by 331 (43 self)
 Add to MetaCart
09, 49M45, 6502, 65J05, 90C25; Secondary 26B25, 41A65, 46C99, 46N10, 47N10, 52A05, 52A41, 65F10, 65K05, 90C90, 92C55. Key words and phrases. Angle between two subspaces, averaged mapping, Cimmino's method, computerized tomography, convex feasibility problem, convex function, convex
Automatic Translation of FORTRAN Programs to Vector Form
 ACM Transactions on Programming Languages and Systems
, 1987
"... This paper discusses the theoretical concepts underlying a project at Rice University to develop an automatic translator, called PFC (for Parallel FORTRAN Converter), from FORTRAN to FORTRAN 8x. The Rice project, based initially upon the research of Kuck and others at the University of Illinois [6, ..."
Abstract

Cited by 329 (34 self)
 Add to MetaCart
This paper discusses the theoretical concepts underlying a project at Rice University to develop an automatic translator, called PFC (for Parallel FORTRAN Converter), from FORTRAN to FORTRAN 8x. The Rice project, based initially upon the research of Kuck and others at the University of Illinois [6
Plans As Complex Mental Attitudes
 Intentions in Communication
, 1990
"... this paper was supported by a gift from the Systems Development Foundation. The research was done as part of my doctoral thesis [19], which was supported by a gift from the Systems Development Foundation, by an IBM Graduate Fellowship, by the Defense Advanced Research Projects Agency under Contract ..."
Abstract

Cited by 259 (3 self)
 Add to MetaCart
N0003984K0078 and by the Office of Naval Research under Contract N00014855C0013. My sincere thanks to Barbara Grosz, and to all the others, too numerous to list here, who contributed to my thesis effort.
An N4C DTN Router Node Design
"... We describe the design for a Delay Tolerant Network (DTN) node to be used in the N4C project's summer 2009 trials to be held in conjunction with the ExtremeCom workshop. The design uses COTS products and applications; the DTN2 implementation of the Bundle Protocol (BP) and provides basic networ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We describe the design for a Delay Tolerant Network (DTN) node to be used in the N4C project's summer 2009 trials to be held in conjunction with the ExtremeCom workshop. The design uses COTS products and applications; the DTN2 implementation of the Bundle Protocol (BP) and provides basic
A System for Video Surveillance and Monitoring
, 2000
"... Under the threeyear Video Surveillance and Monitoring (VSAM) project (19971999), the Robotics Institute at Carnegie Mellon University (CMU) and the Sarnoff Corporation developed a system for autonomous Video Surveillance and Monitoring. The technical approach uses multiple, cooperative video s ..."
Abstract

Cited by 232 (0 self)
 Add to MetaCart
contract DAAB0797CJ031, and by the Office of Naval Research under grant N000149910646. 1 Introduction The thrust of CMU research under the DARPA Video Surveillance and Monitoring (VSAM) project is cooperative multisensor surveillance to support battlefield awareness [17]. Under our VSAM Integrated
Results 1  10
of
7,826