Results 1  10
of
2,686,111
Spatiotemporal energy models for the Perception of Motion
 J. OPT. SOC. AM. A
, 1985
"... A motion sequence may be represented as a single pattern in xyt space; a velocity of motion corresponds to a threedimensional orientation in this space. Motion sinformation can be extracted by a system that responds to the oriented spatiotemporal energy. We discuss a class of models for human mot ..."
Abstract

Cited by 895 (9 self)
 Add to MetaCart
A motion sequence may be represented as a single pattern in xyt space; a velocity of motion corresponds to a threedimensional orientation in this space. Motion sinformation can be extracted by a system that responds to the oriented spatiotemporal energy. We discuss a class of models for human
Fast Parallel Algorithms for ShortRange Molecular Dynamics
 JOURNAL OF COMPUTATIONAL PHYSICS
, 1995
"... Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of interatomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dyn ..."
Abstract

Cited by 660 (7 self)
 Add to MetaCart
. The algorithms are tested on a standard LennardJones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers  the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray YMP and C90 algorithm shows
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 674 (15 self)
 Add to MetaCart
X passes to its parent U; is given by: and the message X sends to its child Y j is given by: k;Cj For noisyor links between parents and children, there exists an analytic expression for 1r( x) and Ax ( u;) that avoids the exhaustive enumeration over parent config urations We made a slight
On the bursty evolution of Blogspace
, 2003
"... O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +%&P &.F0, )& ;)S O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +% # O,<&7& =1 P &7"U;(Z ;>A@CB;D,[\D]K,D?^_ B`Bba]@C>Ac >AG8H$^2d)@C]E 9='0,*+82 &e " & Q (T0 U;Ub%&7*',#$ %& :3 Q ..."
Abstract

Cited by 364 (8 self)
 Add to MetaCart
O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +%&P &.F0, )& ;)S O)( 1 #$ #+&PQ+&,0,/RP 2 ":9:0/ +% # O,<&7& =1 P &7"U;(Z ;>A@CB;D,[\D]K,D?^_ B`Bba]@C>Ac >AG8H$^2d)@C]E 9='0,*+82 &e " & Q (T0 U;Ub%&7*',#$ %& :3
Trading Group Theory for Randomness
, 1985
"... In a previous paper [BS] we proved, using the elements of the Clwory of nilyotenf yroupu, that some of the /undamcnla1 computational problems in mat & proup, belong to NP. These problems were also ahown to belong to CONP, assuming an unproven hypofhedi.9 concerning finilc simple Q ’ oup,. The a ..."
Abstract

Cited by 353 (9 self)
 Add to MetaCart
) about the rctation ICj=N provided Arthur trusts conclusions based on st,atisticnl rvidrnce (such as a SolovayStrassen type “proof” of primatit,y). One can prove that AM consists precisely of t&ose langungrs which belong to iV @ for almost every oracle 13. Our hirrarchy has an intrrcsjdng, still
Practical Graph Isomorphism
, 1981
"... We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh.ic ..."
Abstract

Cited by 335 (7 self)
 Add to MetaCart
We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh
Visibility Preprocessing For Interactive Walkthroughs
 IN: COMPUTER GRAPHICS (SIGGRAPH 91 PROCEEDINGS
, 1991
"... The number of polygons comprising interesting architectural models is many more than can be rendered at interactive frame rates. However, due to occlusion by opaque surfaces (e.g., walls), only a small fraction of atypical model is visible from most viewpoints. We describe a method of visibility pre ..."
Abstract

Cited by 333 (16 self)
 Add to MetaCart
preprocessing that is efficient and effective for axisaligned or axial architectural models, A model is subdivided into rectangular cc//.$whose boundaries coincide with major opaque surfaces, Nonopaque p(~rtc~/.rare identified rm cell boundaries. and used to form ana~ju{~’n~y,q)f~/>//con nectingthe cells
Pyramidal implementation of the Lucas Kanade feature tracker
 Intel Corporation, Microprocessor Research Labs
, 2000
"... grayscale value of the two images are the location x = [x y] T, where x and y are the two pixel coordinates of a generic image point x. The image I will sometimes be referenced as the first image, and the image J as the second image. For practical issues, the images I and J are discret function (or ..."
Abstract

Cited by 309 (0 self)
 Add to MetaCart
grayscale value of the two images are the location x = [x y] T, where x and y are the two pixel coordinates of a generic image point x. The image I will sometimes be referenced as the first image, and the image J as the second image. For practical issues, the images I and J are discret function (or
Common Randomness in Information Theory and Cryptography Part II: CR capacity
 IEEE Trans. Inform. Theory
, 1993
"... The CR capacity of a twoteminal model is defined as the maximum rate of common randomness that the terminals can generate using resources specified by the given model. We determine CR capacity for several models, including those whose statistics depend on unknown parameters. The CR capacity is show ..."
Abstract

Cited by 306 (13 self)
 Add to MetaCart
channels with feedback. Key words: common randomness, identification capacity, correlated sources, arbitrarily varying channel, feedback, randomization. I. Csisz'ar was partially supported by the Hungarian National Foundation for Scientific Research, Grant T16386. 1 Introduction Suppose two
A steepest descent method for oscillatory Riemann–Hilbert problems: asymptotics for the MKdV equation
 Ann. of Math
, 1993
"... In this announcement we present a general and new approach to analyzing the asymptotics of oscillatory RiemannHilbert problems. Such problems arise, in particular, in evaluating the longtime behavior of nonlinear wave equations solvable by the inverse scattering method. We will restrict ourselves ..."
Abstract

Cited by 302 (27 self)
 Add to MetaCart
here exclusively to the modified Korteweg de Vries (MKdV) equation, yt − 6y 2 yx + yxxx = 0, − ∞ < x < ∞, t ≥ 0, y(x, t = 0) = y0(x), but it will be clear immediately to the reader with some experience in the field, that the method extends naturally and easily to the general class of wave
Results 1  10
of
2,686,111