×

Facilitating memory constrained client devices by employing deck reduction techniques

  • US 6,523,062 B1
  • Filed: 06/29/1999
  • Issued: 02/18/2003
  • Est. Priority Date: 06/29/1999
  • Status: Expired due to Fees
First Claim
Patent Images

1. In a computing environment capable of having a connection to a network, a computer program product for facilitating network delivery of documents encoded as decks to client devices, said computer program product residing on a storage medium readable by a computer system in said environment and comprising:

  • computer-readable program code means for fragmenting a deck into a plurality of sub-decks if said deck has a deck size larger than a target size, wherein each of said sub-decks then has a sub-deck size smaller than said target size and wherein said fragmenting does not discard deck content, further comprising;

    computer-readable program code means for decoupling a plurality of cards from said deck;

    computer-readable program code means for building a card adjacency graph, said graph comprising a plurality of nodes and links between selected ones of said nodes, wherein each of said nodes represents a card existing in or referenced from said deck and wherein each of said links represents an adjacency relationship between a pair of cards corresponding to a pair of said selected nodes;

    computer-readable program code means for applying a card localization process to said card adjacency graph, further comprising computer-readable program code means for creating a set of distance tuples from said card adjacency graph; and

    computer-readable program code means for aggregating said decoupled cards into said sub-decks using said set of distance tuples; and

    computer-readable program code means for rebinding said sub-decks to one another.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×