BackgroundCheck.run
Search For

Puneet Sharma, 43745 Bridge Creek Dr, San Ramon, CA 94582

Puneet Sharma Phones & Addresses

11386 NW Odeon Ln, Portland, OR 97229   

San Ramon, CA   

Lebanon, OR   

El Paso, TX   

Beaverton, OR   

Vancouver, WA   

Jersey City, NJ   

Work

Company: MOBILE Address: El Paso, TX 88536

Education

School / High School: collaboration
Get Report
Control this profile

Mentions for Puneet Sharma

Career records & work history

Lawyers & Attorneys

Puneet Sharma Photo 1

Puneet Sharma - Lawyer

ISLN:
1000783806
Admitted:
2017

Medicine Doctors

Puneet Sharma

Specialties:
Cardiovascular Disease
Work:
Sanford Aberdeen Clinic
3015 3 Ave SE STE 100, Aberdeen, SD 57401
605-2265500 (phone) 605-7251761 (fax)
Education:
Medical School
P T B D S Postgrad Inst of Med Sci, M Dayanand Univ, Rohtak, Haryana, India
Graduated: 1996
Procedures:
Cardiac Rehabilitation, Angioplasty, Cardiac Catheterization, Cardiac Stress Test, Cardioversion, Continuous EKG, Echocardiogram, Electrocardiogram (EKG or ECG)
Conditions:
Acute Myocardial Infarction (AMI), Acute Pancreatitis, Angina Pectoris, Aortic Valvular Disease, Arterial Thromboembolic Disease, Atherosclerosis, Atrial Fibrillation and Atrial Flutter, Bronchial Asthma, Cardiac Arrhythmia, Cardiomyopathy, Chronic Renal Disease, Conduction Disorders, Congenital Anomalies of the Heart, Diabetes Mellitus (DM), Disorders of Lipoid Metabolism, Endocarditis, Fractures, Dislocations, Derangement, and Sprains, Heart Failure, Hypertension (HTN), Ischemic Heart Disease, Mitral Valvular Disease, Paroxysmal Supreventricular Tachycardia (PSVT), Pulmonary Embolism, Substance Abuse and/or Dependency, Valvular Heart Disease, Venous Embolism and Thrombosis
Languages:
English
Description:
Dr. Sharma graduated from the P T B D S Postgrad Inst of Med Sci, M Dayanand Univ, Rohtak, Haryana, India in 1996. He works in Aberdeen, SD and specializes in Cardiovascular Disease. Dr. Sharma is affiliated with Sanford Aberdeen Medical Center.

Publications & IP owners

Us Patents

System And Method For Striping Delay-Sensitive Data Over Multiple Bursty Channels

US Patent:
7372820, May 13, 2008
Filed:
Oct 29, 2004
Appl. No.:
10/977147
Inventors:
Gene Cheung - Tokyo, JP
Puneet Sharma - Palo Alto CA, US
Sung-Ju Lee - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04J 1/16
H04J 3/16
US Classification:
370252, 370465
Abstract:
Embodiments of the present invention include a method for striping data comprising accessing data to be striped over a plurality of wireless channels, accessing time sensitivity information associated with the data and mapping the data to the plurality of wireless channels wherein the time sensitivity information is used determine the mapping. The method further includes striping the data over the plurality of wireless channels.

Routing A Service Query In An Overlay Network

US Patent:
7529196, May 5, 2009
Filed:
Dec 7, 2004
Appl. No.:
11/006041
Inventors:
Sujoy Basu - Menlo Park CA, US
Sujata Banerjee - Sunnyvale CA, US
Puneet Sharma - Palo Alto CA, US
Sung-Ju Lee - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04L 12/28
US Classification:
370254, 370255, 370351, 709238
Abstract:
A query including a plurality of attributes and attribute values for a desired service is received. The query is routed to a destination in the overlay network using different attributes in the query.

Splitting A Workload Of A Node

US Patent:
7596618, Sep 29, 2009
Filed:
Dec 7, 2004
Appl. No.:
11/006061
Inventors:
Sujoy Basu - Menlo Park CA, US
Sujata Banerjee - Sunnyvale CA, US
Puneet Sharma - Palo Alto CA, US
Sung-Ju Lee - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 9/46
G06F 15/173
H04W 72/00
US Classification:
709226, 718105, 455453
Abstract:
A node is identified from a set of nodes in a peer-to-peer network having the highest workloads in the peer-to-peer network. The workload of the node is split with another node using a splitting algorithm.

Determining Highest Workloads For Nodes In An Overlay Network

US Patent:
7636325, Dec 22, 2009
Filed:
Dec 7, 2004
Appl. No.:
11/006068
Inventors:
Sujoy Basu - Menlo Park CA, US
Sujata Banerjee - Sunnyvale CA, US
Puneet Sharma - Palo Alto CA, US
Sung-Ju Lee - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04L 12/28
US Classification:
370254, 370351, 709220
Abstract:
Nodes in a network are operable to provide an information service. A set of the nodes having a highest workload are identified by routing a list of workloads for the nodes through the network to a final destination. Each node receiving the list determines whether to include a workload of a respective node in the list.

Path Selection In A Network

US Patent:
7643426, Jan 5, 2010
Filed:
Apr 27, 2006
Appl. No.:
11/412442
Inventors:
Sung-Ju Lee - Los Altos CA, US
Sujata Banerjee - Sunnyvale CA, US
Puneet Sharma - Palo Alto CA, US
Sujoy Basu - Sunnyvale CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04L 12/28
US Classification:
370238, 370392, 370468
Abstract:
A path in a network is selected by selecting candidate overlay paths between two nodes in the network based on a static network metric determined for each of a plurality of overlay paths. A time sensitive network metric is determined for each of the candidate overlay paths, and a path is selected from the candidate overlay paths based on the time sensitive network metrics.

Identifying A Service Node In A Network

US Patent:
7644167, Jan 5, 2010
Filed:
Oct 8, 2004
Appl. No.:
10/960605
Inventors:
Sung-Ju Lee - Los Altos CA, US
Sujata Banerjee - Sunnyvale CA, US
Puneet Sharma - Palo Alto CA, US
Sujoy Basu - Menlo Park CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G06F 15/16
US Classification:
709229, 709217, 709225, 709226
Abstract:
A request is received from a first node in a network. The request includes a request for a service node operable to provide a desired service. At least one service node is identified that is operable to provide the desired service based at least on location information for the first node.

Striping Data Over Transmission Channels

US Patent:
7733913, Jun 8, 2010
Filed:
Jul 31, 2006
Appl. No.:
11/496321
Inventors:
Gene Cheung - Tokyo, JP
Puneet Sharma - Palo Alto CA, US
Sung-Ju Lee - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
H04J 3/24
US Classification:
370474
Abstract:
Data is striped over transmission channels having limited bandwidths and variable delays. Data to be striped over the channels is accessed. An expiration time of at least one packet of the data to be striped is determined. Probabilities of timely receiving the at least one packet are determined using a recursive function and the expiration time and a length of queue storing the at least one packet waiting to be striped. The computed probabilities are stored in a table, and the computed probabilities are retrieved from the table for at least one other packet having the same expiration time and the same queue length. The probabilities are used to map the at least one other packet to at least one of the channels.

Distributed Network Distance Determination Using A Distributed Hash Table Overlay Network

US Patent:
7965655, Jun 21, 2011
Filed:
Jan 31, 2007
Appl. No.:
11/700579
Inventors:
Praveen Yalagandula - Redwood City CA, US
Puneet Sharma - Menlo Park CA, US
Sujata Banerjee - Sunnyvale CA, US
Sung-Ju Lee - Los Altos CA, US
Assignee:
Hewlett-Packard Development Company, L.P. - Houston TX
International Classification:
G08C 15/00
US Classification:
370255, 370252, 370256, 370539, 725 86
Abstract:
Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

Possible Relatives

David T Sharma  Davinder Sharma  Daya S Sharma  Deep S Sharma  Deepa Sharma  Deepak K Sharma  Deepali Sharma  Puneet J Singh  Puneet Ahluwalia  Puneet Arora 

NOTICE: You may not use BackgroundCheck or the information it provides to make decisions about employment, credit, housing or any other purpose that would require Fair Credit Reporting Act (FCRA) compliance. BackgroundCheck is not a Consumer Reporting Agency (CRA) as defined by the FCRA and does not provide consumer reports.