Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Jagged array

Known as: Array, Ragged array 
In computer science, a jagged array, also known as a ragged array, is an array of arrays of which the member arrays can be of different sizes… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The financial crisis has been characterised by fragmentation in the transmission of monetary policy, reflected in high dispersion… Expand
2011
2011
Real-time macroeconomic data are typically incomplete for today and the immediate past (‘ragged edge’) and subject to revision… Expand
  • figure 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
2010
Highly Cited
2010
Five certain impact craters and 44 additional nearly certain and probable ones have been identified on the 22% of Titan’s surface… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2006
Highly Cited
2006
In this paper we present a method for abstracting an environment represented using constrained Delaunay triangulations in a way… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2004
2004
In this dissertation we have identified vector processing shortcomings related to the efficient storing and processing of sparse… Expand
  • figure 1.1
  • figure 2.2
  • figure 2.6
  • figure 2.8
  • figure 2.11
2003
2003
We describe and evaluate a Hierarchical Sparse Matrix (HiSM) storage format designed to be a unified format for sparse matrix… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 4
2002
2002
In this paper we present some preliminary performance evaluations of the Block Based Compression Storage (BBCS) scheme and of a… Expand
2000
2000
This paper presents an evaluation of the BBCS scheme meant to alleviate the performance degradation experienced by Vector… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
1999
1999
A hyper-rectangle is commonly used as a bounding predicate in tree-based access methods in databases. To reduce the number of I/O… Expand
  • figure 1
  • figure 2
1992
1992
I n t r o d u c t i on This analysis continues on Ill, where for any practical, terminating prSgr.am, a set of single entry and… Expand