Wraparound (video games)

Known as: Wraparound, Wraparound (gaming), Wraparound (video gaming) 
Wraparound, in video games, is a gameplay variation on the single-screen in which space is finite but unbounded; objects leaving one side of the… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2018
05101519762018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
To reduce blur in noisy images, regularized image restoration methods have been proposed that use nonquadratic regularizers (like… (More)
  • table I
  • table II
  • table III
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Current-perpendicular-to-plane (CPP) giant magnetoresistive (GMR) read heads and wraparound shielded write heads for… (More)
  • figure 3
Is this relevant?
2002
2002
The Radon transform is a fundamental tool in many areas. For example, in reconstruction of an image from its projections (CT… (More)
  • figure 1
  • figure 3
  • figure 6
  • figure 8
  • figure 11
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We define a notion of Radon Transform for data in an n by n grid. It is based on summation along lines of absolute slope less… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2000
2000
We analyze limited-wavelength translation in regular all-optical, wavelength division multiplexed (WDM) networks, where up to W… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
1998
1998
We analyze limited wavelength translation in all-optical, wavelength division multiplexed (WDM) wraparound mesh networks, where… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The honeycomb mesh, based on hexagonal plane tessellation, is considered as a multiprocessor interconnection network. A honeycomb… (More)
  • figure 1
  • table 1
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
1996
1996
We establish upper and lower bounds on the layout area of the butterfly network (without wraparound), which differ only in low… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1992
1992
Varvarigos, E.A. and D.P. Bertsekas, Communication algorithms for isotropic tasks in hypercubes and wraparound meshes, Parallel… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?