User contributions for Rice
From Rice Wiki
6 March 2024
- 00:4800:48, 6 March 2024 diff hist −4 Template:Infobox Algorithm No edit summary current
- 00:4600:46, 6 March 2024 diff hist +23 N Minimum Spanning Tree Created page with "Category:Algorithms"
- 00:4400:44, 6 March 2024 diff hist +4 Dijkstra's Algorithm →Approach Tag: Visual edit
- 00:4400:44, 6 March 2024 diff hist +155 Dijkstra's Algorithm No edit summary Tag: Visual edit
- 00:4300:43, 6 March 2024 diff hist −56 Template:Infobox Algorithm No edit summary
- 00:4300:43, 6 March 2024 diff hist +50 Dijkstra's Algorithm No edit summary Tag: Visual edit
- 00:1400:14, 6 March 2024 diff hist +73 Dijkstra's Algorithm No edit summary Tag: Visual edit
- 00:1200:12, 6 March 2024 diff hist +59 N Dijkstra's Algorithm Created page with "Category:Algorithms Problem: Shortest Path Problem." Tag: Visual edit: Switched
- 00:0500:05, 6 March 2024 diff hist +103 Bellman-Ford Algorithm No edit summary
- 00:0400:04, 6 March 2024 diff hist −1,097 Shortest Path Problem →Implementation: Bellman Ford Tag: Visual edit
- 00:0200:02, 6 March 2024 diff hist −1 Bellman-Ford Algorithm No edit summary
5 March 2024
- 23:5923:59, 5 March 2024 diff hist +41 Bellman-Ford Algorithm No edit summary Tag: Visual edit
- 23:5823:58, 5 March 2024 diff hist +1,523 N Bellman-Ford Algorithm Created page with "Category:Algorithms = Approach: dynamic programming = All shortest path must have <math> \leq |V| - 1 </math> edges. If this condition is not satisfied, there is a cycle in in the path, and therefore it is not the shortest. ==== Recurrence ==== Let OPT(n-1, a) be the length of the shortest path from source node <math>s</math> to node <math>a</math> with at most <math>n - 1</math> edges. The idea is to add one edge at a time, seeing if the edge should be included i..." Tag: Visual edit
- 23:4023:40, 5 March 2024 diff hist +35 Template:Infobox Algorithm No edit summary
- 23:3423:34, 5 March 2024 diff hist +78 DFS No edit summary Tag: Visual edit: Switched
- 23:3323:33, 5 March 2024 diff hist −655 Template:Infobox Algorithm No edit summary
- 23:3323:33, 5 March 2024 diff hist +628 N Template:Infobox Algorithm/doc Created page with " <templatedata> { "description": "Infobox for computer algorithms", "params": { "title": { "label": "Algorithm name", "description": "Name of the algorithm appearing above the infobox", "default": "Page name" }, "runtime": { "label": "Runtime complexity" }, "space": { "label": "Space complexity" }, "class": { "label": "Algorithm classifi..." current
- 23:2623:26, 5 March 2024 diff hist +106 Template:Infobox Algorithm No edit summary
- 23:2223:22, 5 March 2024 diff hist +523 Template:Infobox Algorithm No edit summary
- 23:1323:13, 5 March 2024 diff hist +372 N Template:Infobox Algorithm Created page with "<infobox layout="stacked"> <title source="title"> <default>{{PAGENAME}}</default> </title> <data source="runtime"> <label>Runtime</label> <default>O(n)</default> </data> <data source="space"> <label>Space</label> <default>O(n)</default> </data> <data source="class"> <label>Class</label> </data> </infobox> Category:Algorithms"
- 23:0823:08, 5 March 2024 diff hist +311 Test Page No edit summary current Tag: Visual edit: Switched
- 22:2722:27, 5 March 2024 diff hist +23 N Test Page Created page with " Category:Contents" Tag: Visual edit: Switched
- 03:2803:28, 5 March 2024 diff hist +22 Magnetism No edit summary current Tag: Visual edit: Switched
- 03:2703:27, 5 March 2024 diff hist −1 Category:Cybersecurity No edit summary current
- 03:2603:26, 5 March 2024 diff hist −1 CORS No edit summary current
- 03:2503:25, 5 March 2024 diff hist +22 N Category:Pages with math errors Created page with "Pages with math errors" current Tag: Visual edit
- 03:2303:23, 5 March 2024 diff hist +16 N Category:Computer Science Created page with "Computer Science" Tag: Visual edit
- 03:2203:22, 5 March 2024 diff hist +53 CORS →What is CORS Tag: Visual edit
- 03:2103:21, 5 March 2024 diff hist +30 N Category:Cybersecurity Created page with "Category:Computer Science" Tag: Visual edit
4 March 2024
- 22:3622:36, 4 March 2024 diff hist +157 N Authentication Created page with "= Sources = * [https://owasp.org/Top10/A07_2021-Identification_and_Authentication_Failures/ OWASP Top10 2021 A07 Identification and Authentication Failures]" Tag: Visual edit
- 22:0022:00, 4 March 2024 diff hist +95 Electromagnetism →Parallels Tag: Visual edit
- 21:5821:58, 4 March 2024 diff hist +218 Electromagnetism →Maxwell's Equation Tag: Visual edit
- 21:5321:53, 4 March 2024 diff hist +1,560 N Electromagnetism Created page with "Ampere's law can be proven with Biot Savart Law. It has an addition that doesn't mean much when the electric field is produced by a static charge. Coulomb's law describes that '''charges produce electric fields, influencing charges''' Integrating that electric field over a loop equals zero. Biot Svart's law describes that '''moving charges produce magnetic fields'','' influencing moving charges.''' There is a problem! Somehow, changing magnetic fields causes electron..." Tag: Visual edit
- 21:2721:27, 4 March 2024 diff hist −109 Magnetism →Rings Tag: Visual edit
- 21:2621:26, 4 March 2024 diff hist +624 Magnetism →Special Field: Wire Tag: Visual edit
- 20:3820:38, 4 March 2024 diff hist +52 N Talk:Main Page →Test topic: new section current
- 04:0604:06, 4 March 2024 diff hist +529 Longest Common Subsequence No edit summary
- 03:5803:58, 4 March 2024 diff hist −13 Longest Common Subsequence →Property 1 Tag: Visual edit
- 03:5503:55, 4 March 2024 diff hist +107 Longest Common Subsequence No edit summary
- 03:5303:53, 4 March 2024 diff hist +1 Longest Common Subsequence →Property 4 Tag: Visual edit
- 03:5303:53, 4 March 2024 diff hist +1,415 Longest Common Subsequence No edit summary
- 03:3103:31, 4 March 2024 diff hist +440 Longest Common Subsequence No edit summary
- 03:2403:24, 4 March 2024 diff hist +2 Longest Common Subsequence No edit summary Tag: Visual edit
- 03:2303:23, 4 March 2024 diff hist +677 Longest Common Subsequence No edit summary
- 03:1603:16, 4 March 2024 diff hist +372 N Longest Common Subsequence Created page with "= Problem description = A sequence ''Z'' is a subsequence of another sequence ''X'' if all the elements in ''Z'' also appear in order in ''X''. Notably, the elements do ''not'' need to be consecutive. In the '''longest-common-subsequence problem (LCS)''', we wish to find a maximum-length common subsequence of ''X'' and ''Y''. = Approach: dynamic programming = Consider" Tag: Visual edit
- 01:5001:50, 4 March 2024 diff hist +15 Academics No edit summary current Tag: Visual edit
3 March 2024
- 19:5019:50, 3 March 2024 diff hist +527 CORS →Implementation Tag: Visual edit
- 18:2818:28, 3 March 2024 diff hist −182 CORS →Same-origin policy Tag: Visual edit
- 06:2306:23, 3 March 2024 diff hist +333 CORS →Same-origin policy Tag: Visual edit
- 00:4500:45, 3 March 2024 diff hist +86 CORS →Define. Origin Tag: Visual edit
