Group items tagged

Filter: All | Bookmarks | Topics Simple Middle

TensorFlow -- an Open Source Software Library for Machine Intelligence - 0 views

Janos Haits on 08 May 17

"TensorFlow™ is an open source software library for numerical computation using data flow graphs. Nodes in the graph represent mathematical operations, while the graph edges represent the multidimensional data arrays (tensors) communicated between them. The flexible architecture allows you to deploy computation to one or more CPUs or GPUs in a desktop, server, or mobile device with a single API. TensorFlow was originally devel"

<div class="cArrow"> </div><div class="cContentInner">"TensorFlow™ is an open source software library for numerical computation using data flow graphs. Nodes in the graph represent mathematical operations, while the graph edges represent the multidimensional data arrays (tensors) communicated between them. The flexible architecture allows you to deploy computation to one or more CPUs or GPUs in a desktop, server, or mobile device with a single API. TensorFlow was originally devel"</div>

...

Cancel

Common Mistakes in Online and Real-time Contests - 0 views

www.acm.org/...contests.html

shared by Abdelrahman Ogail on 09 Jun 09 - Cached

Islam TeCNo liked it

Dynamic programming problems are to be solved with tabular methods
- Ahmed Mansour on 09 Jun 09
  
  Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. ("Programming" in this context refers to a tabular method, not to writing computer code) y3ney 3bara 3n 2nene bn2sem el problem el kbirr le shwit probelsm so3'ira .. we ne solve el problems deh we ngma el yab2a dh 7l lel problem el kbira :D;d see introduction to algorithms book . chapter 15
  
  <div class="cArrow"> </div><div class="cContentInner">Dynamic programming, like the divide-and-conquer method, solves problems by combining the solutions to subproblems. ("Programming" in this context refers to a tabular method, not to writing computer code) y3ney 3bara 3n 2nene bn2sem el problem el kbirr le shwit probelsm so3'ira .. we ne solve el problems deh we ngma el yab2a dh 7l lel problem el kbira :D;d see introduction to algorithms book . chapter 15</div>
  
  ...
  
  Cancel
...

Cancel
breadth-first search
- Ahmed Mansour on 09 Jun 09
  
  In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. ya3ney be el 3arby keda lw ana 3ndy tree maslan we el tree dh bettkwen mn shwit levels 3ady gedan.. lama hagey 23mel search 3la node mo3ina fi el tree deh hamsk el tree mn el root bet3ha ely hwa level 0 we habda2 2mshy level by level y3ney hanzl 3la el level 1 we hakaz le 3'it mal2y el node bet3ty ,,,, see this ,, it's a tutorial show how BFS algorithm is work!! http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm
  
  <div class="cArrow"> </div><div class="cContentInner">In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal. ya3ney be el 3arby keda lw ana 3ndy tree maslan we el tree dh bettkwen mn shwit levels 3ady gedan.. lama hagey 23mel search 3la node mo3ina fi el tree deh hamsk el tree mn el root bet3ha ely hwa level 0 we habda2 2mshy level by level y3ney hanzl 3la el level 1 we hakaz le 3'it mal2y el node bet3ty ,,,, see this ,, it's a tutorial show how BFS algorithm is work!! <a href="http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm" rel="nofollow" target="_blank">http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm</a></div>
  
  ...
  
  Cancel
...

Cancel
Memorize the value of pi You should always try to remember the value of pi as far as possible, 3.1415926535897932384626433832795, certainly the part in italics. The judges may not give the value in the question, and if you use values like 22/7 or 3.1416 or 3.142857, then it is very likely that some of the critical judge inputs will cause you to get the wrong answer. You can also get the value of pi as a compiler-defined constant or from the following code: Pi=2*acos(0)
- Islam TeCNo on 09 Jun 09
  
  hhhhhhhhhhh ...... awl mara a3rf el mawdo3 dah we awl mara a3raf en el Pi = 2*acos(0)
  
  <div class="cArrow"> </div><div class="cContentInner">hhhhhhhhhhh ...... awl mara a3rf el mawdo3 dah we awl mara a3raf en el Pi = 2*acos(0)</div>
  
  ...
  
  Cancel
- Abdelrahman Ogail on 09 Jun 09
  
  Thanks Islam for the info, really useful
  
  <div class="cArrow"> </div><div class="cContentInner">Thanks Islam for the info, really useful</div>
  
  ...
  
  Cancel
...

Cancel
...4 more annotations...
You cannot always check the equality of floating point numbers with the = = operator in C/C++. Logically their values may be same, but due to precision limit and rounding errors they may differ by some small amount and may be incorrectly deemed unequal by your program
...

Cancel
#define swap(xxx, yyy) (xxx) ^= (yyy) ^= (xxx) ^= (yyy)
- Islam TeCNo on 09 Jun 09
  
  I remember someone told me that it's impossible to do swaping using macros :D ...but i think it's possible
  
  <div class="cArrow"> </div><div class="cContentInner">I remember someone told me that it's impossible to do swaping using macros :D ...but i think it's possible</div>
  
  ...
  
  Cancel
...

Cancel
But recursion should not be discounted completely, as some problems are very easy to solve recursively (DFS, backtracking)
- Islam TeCNo on 09 Jun 09
  
  Some problems are much easier when using recursion
  
  <div class="cArrow"> </div><div class="cContentInner">Some problems are much easier when using recursion</div>
  
  ...
  
  Cancel
...

Cancel
Having a good understanding of probability is vital to being a good programmer
...

Cancel

Ahmed Mansour on 09 Jun 09

for bignner acmers hoping to be useful !

<div class="cArrow"> </div><div class="cContentInner">for bignner acmers hoping to be useful !</div>

...

Cancel
Ahmed Mansour on 09 Jun 09

in this article the author discuss the common problems that faced teams in ACM contests .. and how to avoid it !

<div class="cArrow"> </div><div class="cContentInner">in this article the author discuss the common problems that faced teams in ACM contests .. and how to avoid it !</div>

...

Cancel

Design and Analysis of Computer Algorithms - 0 views

www.personal.kent.edu/...algorithm.html

shared by Islam TeCNo on 09 Jun 09 - Cached

Islam TeCNo liked it

Dijkstra's Algorithm
- Islam TeCNo on 09 Jun 09
  
  Algorithm for finding shortest path is graph
  
  <div class="cArrow"> </div><div class="cContentInner">Algorithm for finding shortest path is graph</div>
  
  ...
  
  Cancel
...

Cancel
Huffman's Codes
- Islam TeCNo on 09 Jun 09
  
  used in data compression
  
  <div class="cArrow"> </div><div class="cContentInner">used in data compression</div>
  
  ...
  
  Cancel
...

Cancel

Ahmed Mansour on 09 Jun 09

recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !

<div class="cArrow"> </div><div class="cContentInner">recommended !! :D Mathematics for Algorithmic Sets Functions and Relations Vectors and Matrices Linear Inequalities and Linear Equations Greedy Algorithms Knapsack Problem o O-I Knapsack o Fractional Knapsack * Activity Selection Problem * Huffman's Codes * Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Dijkstra's Algorithm Divide & Conquer Algorithms Dynamic Programming Algorithms * Knapsack Problem DP Solution * Activity Selection Problem DP Solution Amortized Analysis * Aggregate Method * Accounting Method * Potential Method * Dynamic Table Hash Table Binary Search Tree Graph Algorithms * Breadth First Search (BFS) * Depth First Search (DFS) * Topological Sort * Strongly Connected Components * Euler Tour * Generic Minimum Spanning Tree * Kruskal's Algorithm * Prim's Algorithm * Single Source Shortest Path o Dijkstra's Algorithm o Bellman-Ford Algorithm String Matching * Naïve String Matching * Knuth-Morris-Pratt Algorithm * Boyer-Moore Algorithm Sorting * Bubble Sort * Insertion Sort * Selection Sort * Shell Sort * Heap Sort * Merge Sort * Quick Sort Linear-Time Sorting * Counting Sort * Radix Sort * Bucket Sort Computational Geometry Computational Complexity * Information-Theoretic Argument * Adversary Argument * NP-Completeness And Reduction Approximate Algorithms * Vertex Cover * The Traveling Salesman Problem Linear Programming Appendix 1. Parabola 2. Tangent Codes References hoping to discuss these algorithms with each other !</div>

...

Cancel
Ahmed Mansour on 09 Jun 09

this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !

<div class="cArrow"> </div><div class="cContentInner">this web page contain a lot of algorithms discussed with simple ways !! i think these maybe useful Tutorials !! hoping to discuss these algorithms with each other !</div>

...

Cancel
Islam TeCNo on 09 Jun 09

Ohhhhhhh .....Gammmeeeeeeeeed gedan ya Mans ...thanks

<div class="cArrow"> </div><div class="cContentInner">Ohhhhhhh .....Gammmeeeeeeeeed gedan ya Mans ...thanks</div>

...

Cancel

Cytoscape: An Open Source Platform for Complex-Network Analysis and Visualization - 0 views

Janos Haits on 03 Apr 18

Cytoscape is an open source software platform for visualizing complex-networks and integrating these with any type of attribute data. A lot of plugins are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.

<div class="cArrow"> </div><div class="cContentInner">Cytoscape is an open source software platform for visualizing complex-networks and integrating these with any type of attribute data. A lot of plugins are available for various kinds of problem domains, including bioinformatics, social network analysis, and semantic web.</div>

...

Cancel

GraphQL | A query language for your API - 0 views

graphql.org

query api language data graph facebook rest Computer development Programming technology tools

shared by Janos Haits on 21 Nov 17 - No Cached

Janos Haits on 21 Nov 17

'GraphQL is a query language for APIs and a runtime for fulfilling those queries with your existing data. GraphQL provides a complete and understandable description of the data in your API, gives clients the power to ask for exactly what they need and nothing more, makes it easier to evolve APIs over time, and enables powerful developer tools.'

<div class="cArrow"> </div><div class="cContentInner">'GraphQL is a query language for APIs and a runtime for fulfilling those queries with your existing data. GraphQL provides a complete and understandable description of the data in your API, gives clients the power to ask for exactly what they need and nothing more, makes it easier to evolve APIs over time, and enables powerful developer tools.'</div>

...

Cancel

AI for Research | Scite - 0 views

scite.ai

citations graph science research data tool technology service tools

shared by Janos Haits on 19 May 24 - No Cached

Janos Haits on 19 May 24

"Ask a question, get an answer backed by real research"

<div class="cArrow"> </div><div class="cContentInner">"Ask a question, get an answer backed by real research"</div>

...

Cancel

1 - 6 of 6

Showing 20▼ items per page