For loop

Known as: For, Loop counter, For statement 
In computer science a for-loop (or simply for loop) is a control flow statement for specifying iteration, which allows code to be executed repeatedly… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
In appearance-based localization and mapping, loop-closure detection is the process used to determinate if the current… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • table II
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present a method for detecting revisited places in a image sequence in real time by using efficient features. We introduce… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A full-duplex relay enhances the end-to-end spectral efficiency compared to a half-duplex relay, provided that the loop-back… (More)
  • figure 2
  • figure 1
  • table I
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This brief analyzes the jitter as well as the power dissipation of phase-locked loops (PLLs). It aims at defining a benchmark… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
In robotic applications of visual simultaneous localization and mapping techniques, loop-closure detection and global… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper describes a probabilistic framework for navigation using only appearance data. By learning a generative model of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Current parallelizing compilers cannot identify a significant fraction of parallelizable loops because they have complex or… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A new distributed algorithm for the dynamic computation of multiple loop-freepaths from source to destination in a computer… (More)
  • figure 1
  • figure 2
  • figure 4
  • table I
  • table II
Is this relevant?
Highly Cited
1997
Highly Cited
1997
| A loop-free path-nding algorithm (LPA) is presented ; this is the rst routing algorithm that eliminates the formation of… (More)
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper, we study run-time methods to automatically parallelize and schedule iterations of a do loop in certain cases… (More)
  • figure 1
  • figure 2
  • figure 4
  • table I
  • table 2
Is this relevant?