Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 219,937,491 papers from all fields of science
Search
Sign In
Create Free Account
RealD 3D
Known as:
RealD Cinema
, Real-D
, REAL D Cinema
Expand
RealD 3D is a digital stereoscopic projection technology made and sold by RealD. It is currently the most widely used technology for watching 3D…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
3D film
4DX
Circular polarization
Digital 3D
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
BIAYA KEMACETAN RUAS JALAN KOTA YOGYAKARTA
I. Basuki
,
S. Siswadi
2008
Corpus ID: 109425779
Congestion problem at one particular joint streets is often happened at urban area. Traffic jam has as a big effect if observed…
Expand
2008
2008
L'especialització vitícola catalana i la formació del mercat blader espanyol: una nova interpretació a partir del cas de la província de Barcelona
R. Segura
,
Enric Tello Aragay
,
Xavier Cussó i Segura
2008
Corpus ID: 191322579
En aquest treball s�analitza el proces d�especialitzacio viticola desenvolupat a la provincia de Barcelona al llarg del segle XIX…
Expand
2007
2007
TRUNCATED MULTIVARIABLE MOMENT PROBLEMS WITH FINITE VARIETY
L. Fialkow
2007
Corpus ID: 502579
Let β ≡ {βi}i∈Zd+,|i|≤2n denote a real d-dimensional multisequence of degree 2n, with moment matrix M(n), and let V ≡ V (M(n…
Expand
2006
2006
Model-based Overlapping Co-Clustering
M. Shafiei
,
E. Milios
2006
Corpus ID: 10444319
Co-clustering or simultaneous clustering of rows and colum ns of two-dimensional data matrices, is a data mining technique w ith…
Expand
Review
2004
Review
2004
BOUNDARY VALUE PROBLEMS ON LIPSCHITZ DOMAINS IN R OR C
Mei-Chi Shaw
2004
Corpus ID: 51770753
The purpose of this note is to bring update results on boundary value problems on Lipschitz domains in R or C. We first discuss…
Expand
2001
2001
On the Efficiency of Nearest Neighbor Searching with Data Clustered in Lower Dimensions
S. Maneewongvatana
,
D. Mount
International Conference on Conceptual Structures
2001
Corpus ID: 6993149
Nearest neighbor searching is an important and fundamental problem in the field of geometric data structures. Given a set S of n…
Expand
2001
2001
An Empirical Study of a New Approach to Nearest Neighbor Searching
S. Maneewongvatana
,
D. Mount
Workshop on Algorithm Engineering and…
2001
Corpus ID: 17467462
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, Rd, and the problem is to…
Expand
1997
1997
Linear Discriminant Analysis for Two Classes via Removal of Classification Structure
M. Aladjem
IEEE Transactions on Pattern Analysis and Machine…
1997
Corpus ID: 1619026
A new method for two-class linear discriminant analysis, called "removal of classification structure", is proposed. Its novelty…
Expand
1995
1995
Preconditioning Legendre spectral collocation approximations to elliptic problems
S. Parter
,
E. Rothman
1995
Corpus ID: 11590165
This work deals with the $H^1 $ condition numbers and the distribution of the $\tilde \beta _{N,M} $-singular values of the…
Expand
1968
1968
Algorithm 341: solution of linear programs in 0-1 variables by implicit enumeration
J. L. Byrne
,
L. Proll
Communications of the ACM
1968
Corpus ID: 8889233
The following procedures are based on the Cooley-Tukey algor i thm [1] for comput ing the finite Fourier t r ans fo rm of a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE