G06F7/26

Automated approval
10013237 · 2018-07-03 · ·

Techniques described herein relate to automated approval of resource requests. More specifically, resource request data is retrieved, identified, processed and aggregated to automate approval of the request.

STORAGE DEVICE AND OPERATING METHOD OF STORAGE DEVICE
20170147231 · 2017-05-25 ·

A storage device includes an interface circuit configured to communicate with an external device, nonvolatile memory devices forming a plurality of partitions, and a processing circuit configured to receive a write request, a key, and a value from the interface circuit, to generate a partition identifier and a sort identifier from the received key, to select one of the partitions using the partition identifier, and to sort indexes of accumulated keys corresponding to the selected partition using sort identifiers included in the indexes.

STORAGE DEVICE AND OPERATING METHOD OF STORAGE DEVICE
20170147231 · 2017-05-25 ·

A storage device includes an interface circuit configured to communicate with an external device, nonvolatile memory devices forming a plurality of partitions, and a processing circuit configured to receive a write request, a key, and a value from the interface circuit, to generate a partition identifier and a sort identifier from the received key, to select one of the partitions using the partition identifier, and to sort indexes of accumulated keys corresponding to the selected partition using sort identifiers included in the indexes.

AUTOMATED APPROVAL
20170024187 · 2017-01-26 · ·

Techniques described herein relate to automated approval of resource requests. More specifically, resource request data is retrieved, identified, processed and aggregated to automate approval of the request.

AUTOMATED APPROVAL
20170024187 · 2017-01-26 · ·

Techniques described herein relate to automated approval of resource requests. More specifically, resource request data is retrieved, identified, processed and aggregated to automate approval of the request.

Processing of data arrays and applications including image processing
12399683 · 2025-08-26 · ·

The disclosed technology can be implemented to provide a method for processing data including representing original data in form of a number array with one or more row elements and one or more column elements based on the original data, re-arranging elements of the number array based on properties of corresponding elements in the number array and properties of other elements of the number array to form a re-arranged number array, modifying values of elements of the re-arranged number array by superposing a product of an amplitude variable A and values of a function F selecting from an ensemble of functions, and re-arranging the elements of re-arranged number array with the modified values of elements to generate a modified number array. The amplitude variable A is computed to optimize a cost function associated with the amplitude variable A, the respective function F, and elements of the number array.

Processing of data arrays and applications including image processing
12399683 · 2025-08-26 · ·

The disclosed technology can be implemented to provide a method for processing data including representing original data in form of a number array with one or more row elements and one or more column elements based on the original data, re-arranging elements of the number array based on properties of corresponding elements in the number array and properties of other elements of the number array to form a re-arranged number array, modifying values of elements of the re-arranged number array by superposing a product of an amplitude variable A and values of a function F selecting from an ensemble of functions, and re-arranging the elements of re-arranged number array with the modified values of elements to generate a modified number array. The amplitude variable A is computed to optimize a cost function associated with the amplitude variable A, the respective function F, and elements of the number array.

Reformatting matrices to improve computing efficiency

A data ordering device includes a plurality of inputs N and a plurality of outputs M. There is a sorting network coupled between the plurality of inputs N and the plurality of outputs M. There are one or more latches comprising a buffer coupled between each input of the plurality of inputs N and a corresponding input of the sorting network. There are one or more latches comprising a buffer coupled between each output of the plurality of outputs M and a corresponding output of the sorting network. There is an input for a control signal operative to initiate a sorting of data between the plurality of inputs N and the plurality of outputs M. The data ordering device is coupled to a core of a central processing unit.

IN-PLACE SORTING

Implementations described herein relate to improved in-place sample sorting of data. In various implementations, unsorted elements of a set stored in a first memory segment may be compared to splitter values to determine respective counts of elements of the set that will fit into each of a plurality of buckets bounded by the splitter values. Some number of elements from each of multiple ranges of the first memory segment that correspond to the multiple buckets may be moved to a smaller second memory segment. Remaining elements may be redistributed from at least some of the plurality of ranges of the first memory segment across the plurality of ranges based on comparing the remaining elements to the splitter values. The elements from the second memory segment may then be distributed across the plurality of ranges based on comparing the elements to the splitter values.

In-place sorting

Implementations described herein relate to improved in-place sample sorting of data. In various implementations, unsorted elements of a set stored in a first memory segment may be compared to splitter values to determine respective counts of elements of the set that will fit into each of a plurality of buckets bounded by the splitter values. Some number of elements from each of multiple ranges of the first memory segment that correspond to the multiple buckets may be moved to a smaller second memory segment. Remaining elements may be redistributed from at least some of the plurality of ranges of the first memory segment across the plurality of ranges based on comparing the remaining elements to the splitter values. The elements from the second memory segment may then be distributed across the plurality of ranges based on comparing the elements to the splitter values.