2020
DOI: 10.18203/2349-2902.isj20204682
|View full text |Cite
|
Sign up to set email alerts
|

Stapled versus open haemorrhoidectomy: a prospective study

Abstract: Background: In this era of staplers and advanced techniques in surgery Milligan Morgan technique of open haemorrhoidectomy is still considered as gold standard procedure for symptomatic haemorrhoids. Stapler haemorrhoidectomy, even though it is practiced in many centres has not become common due to various factors. The present study was done to compare the efficacy, safety and advantages, if any, of the stapled haemorrhoidectomy to open procedure.Methods: This prospective study was performed in the department … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…42 In ML, it is common to simply use various random initialisations and local minimisation, which has limited use in physical systems. 43 Examples of random, or pseudo-random, initialisation and minimisation are seen in K -means, 44–46 Gaussian processes, 47 and neural networks. All these methods rely upon minimisation algorithms to locate local minima of the cost function surfaces, and common choices are limited-memory 48,49 quasi-Newton Broyden, 50 Fletcher, 51 Goldfarb, 52 Shanno 53 (L-BFGS) routine and its variants with box-constraints 54,55 for bounded problems such as fitting Gaussian processes.…”
Section: Ll Explorationmentioning
confidence: 99%
“…42 In ML, it is common to simply use various random initialisations and local minimisation, which has limited use in physical systems. 43 Examples of random, or pseudo-random, initialisation and minimisation are seen in K -means, 44–46 Gaussian processes, 47 and neural networks. All these methods rely upon minimisation algorithms to locate local minima of the cost function surfaces, and common choices are limited-memory 48,49 quasi-Newton Broyden, 50 Fletcher, 51 Goldfarb, 52 Shanno 53 (L-BFGS) routine and its variants with box-constraints 54,55 for bounded problems such as fitting Gaussian processes.…”
Section: Ll Explorationmentioning
confidence: 99%