Sciweavers

65 search results - page 3 / 13
» Recursion Versus Iteration with the List as a Data Structure
Sort
View
ISCA
1999
IEEE
90views Hardware» more  ISCA 1999»
13 years 10 months ago
Effective Jump-Pointer Prefetching for Linked Data Structures
Current techniques for prefetching linked data structures (LDS) exploit the work available in one loop iteration or recursive call to overlap pointer chasing latency. Jumppointers...
Amir Roth, Gurindar S. Sohi
FSTTCS
1993
Springer
13 years 10 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
MVA
2007
158views Computer Vision» more  MVA 2007»
13 years 5 months ago
Hybrid object labelling in digital images
The application of a technique for labelling connected components based on the classical recursive technique is studied. The recursive approach permits labelling, counting, and cha...
Julio Martín-Herrero
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
13 years 11 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
ICASSP
2011
IEEE
12 years 9 months ago
Content preference estimation in online social networks: Message passing versus sparse reconstruction on graphs
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
Jacob Chakareski