Kannan ParthasarathyLand O Lakes, FL

8521901, Aug 27, 2013

Dec 22, 2008

12/341307

Ashwani Wason - San Jose CA, US
Nicholas J. Stavrakos - Los Altos CA, US
Kannan Parthasarathy - Palo Alto CA, US
Chris Koopmans - Patras, GR

Citrix Systems, Inc. - Fort Lauderdale FL

G06F 15/16
G01R 31/08

709234, 3702301

A computer-implemented method including providing, at a first device, a packet scheduler layer between a network layer and a transport layer; receiving, at the packet scheduler layer, one or more transmission control protocol (TCP) packets from a sending layer on the first device, wherein the sending layer is one of the network layer or the transport layer; smoothing delivery of at least one of the one or more TCP packets by delaying the delivery; and sending the one or more TCP packets to a receiving layer, wherein the receiving layer is one of the network layer or the transport layer that is not the sending layer.

2007026, Nov 15, 2007

May 12, 2006

11/432951

Chris Koopmans - Sunnyvale CA, US
Kannan Parthasarathy - Palo Alto CA, US

G06F 15/16

709217000, 709203000

A system including a first user agent configured to transmit request data corresponding to a requested web page, wherein the request data includes a request data header, and an optimization server configured to receive the request data, to determine whether the request header data matches a classification of a grouping that identifies cached content data, wherein the grouping is configured based on similarities between a first content data and a second content data; and to transmit the cached content data to the user based on the determination.

2013026, Oct 3, 2013

Mar 30, 2012

13/436671

Kannan Parthasarathy - Palo Alto CA, US
Nicholas James Stavrakos - Los Altos CA, US

G06F 15/173

709224

A method including acquiring a current HTTP transaction; determining whether the current HTTP transaction relates to web browsing for a specific client; acquiring a previous transactions set of the specific client; evaluating whether the current HTTP transaction belongs with the previous transactions set; if the current HTTP transaction belongs with the previous transactions set, adding the current HTTP transaction to the previous transactions set; and if the current HTTP transaction does not belong with the previous transactions set, creating a boundary of a page unit that includes the HTTP transactions of the previous transactions set for computing a page unit time.

2013026, Oct 3, 2013

Mar 30, 2012

13/436658

Kannan Parthasarathy - Palo Alto CA, US
Nicholas James Stavrakos - Los Altos CA, US

H04W 28/06
H04N 21/442
H04W 4/26

725 14, 455405, 455406

A method including determining whether historical content data is available for a time period; acquiring historical content data associated with a web content source if the historical content data is available; determining one or more user experience metrics for a specific terminal based on the acquired historical content data; and acquiring an expected quality of experience score based at least in part on the determined one or more user experience metrics, wherein the expected quality of experience score can be used for providing one or more traffic management optimization rules for current content data to the specific terminal.

6226403, May 1, 2001

Feb 9, 1998

9/020838

Kannan Parthasarathy - Palo Alto CA

Motorola, Inc. - Schaumburg IL

G06K 900

382187

A storage medium (72) having stored thereon a set of instructions, which when loaded into a microprocessor (74), causes the microprocessor (74) to extract strokes from a plurality of characters (76), derive a pre-defined number of stroke models based on the strokes extracted from the plurality of character (78) and represent the plurality of characters as sequences of stroke models (80).

6275611, Aug 14, 2001

Oct 17, 1996

8/732957

Kannan Parthasarathy - Palo Alto CA

Motorola, Inc. - Schaumburg IL

G06K 900

382187

A method of representing handwriting which includes receiving a pen input, for example at a digitizer (10), segmenting the input into strokes (13), grouping the strokes into stroke sub-structures (14) and quantizing the stroke sub-structures according to a predefined set (the "alphabet") of stroke sub-structures. For handwriting recognition, distance measurements are computed between the input stroke sub-structures and members of a predefined set or "alphabet" (19) of stroke sub-structures.

5742705, Apr 21, 1998

Aug 28, 1997

8/919875

Kannan Parthasarathy - Palo Alto CA

G06K 918

382185

A method and apparatus for recognition of handwritten input is disclosed where handwritten input composed of a sequence of (x, y, pen) points, is preprocessed into a sequence of strokes. A short list of candidate characters that are likely matches for the handwritten input is determined by finding a fast matching distance between the input sequence of strokes and a sequence of strokes representing each candidate character of a large character set where the sequence of strokes for each candidate character is derived from statistical analysis of empirical data. A the final sorted list of candidate characters which are likely matches for the handwritten input is determined by finding a detailed matching distance between the input sequence of strokes and the sequence of strokes for each candidate character of the short list. A final selectable list of candidate characters is presented to a user.

6169538, Jan 2, 2001

Aug 13, 1998

9/133751

Steven Nowlan - San Jose CA
Kannan Parthasarathy - Palo Alto CA
Sheridan Rawlins - Sunnyvale CA

Motorola, Inc. - Schaumburg IL

G09G 500

345168

A method and apparatus for implementing a graphical user interface keyboard (10) and a text buffer (12) on an electronic device. A character that is active upon pointer-up is accepted as a text character, even though the character that is active upon pointer-up is different from a character that was active and inserted in the text buffer (12) upon pointer-down.