The Advaith

Brahma Satyam Jagan Mithya Jeevo Brahmaiva Na Parah

Sunday, October 30, 2005

Terms and Tennis Court Link

›
Some Useful Terms A Polytope is different from a Polygon , which is a 2-dim figure. A Polytope is defined by as a Convex Hull of a se...
Wednesday, October 26, 2005

The Serpent and the Rope

›
Last updated: 11/05 ============= Due to running into rough weather (laptop disk crash and hand fracture), I was reasonably offline for most...
11 comments:
Saturday, October 22, 2005

Unbounded polyhedral domains and computability of SUREs

›
Problem: Give a single theorem that characterizes the theorems 1, corollaries 1/2 and skewed variations of corollaries 1/2. In other words,...
Thursday, September 22, 2005

Cornuejols book: Combinatorial Optimization

›
I had been reading this book on and off. Very nice presentation, just like the other books -- like Tarjan's book -- in the series by CBM...
Wednesday, September 21, 2005

Schrijver's book, Tardos result, and {0,+1,-1} matrices

›
Schrijver's book has a chapter 15 which is titled Further polynomiality results in linear programming . In that chapter, he covers some ...
Saturday, September 17, 2005

Srimad Bhagavata-anta

›
In a previous post , I had briefly compared Datta-Atreya and Suka. In this post we will see the how in the 12th chapter of Srimad-Bhagavatha...

Ray Miller's Memoirs

›
The link to a function at UMD to commemorate the career of Ray Miller is this . The following is the introduction to the function: Prof. Ra...
Saturday, September 10, 2005

Tell a story

›
It was the campus of the top graduate school of India. Raj and Ram were walking together, back to their hostel rooms. They were good friends...
Wednesday, September 07, 2005

Unitary graph scheduling problem

›
Approaches: All pair shortest paths max-flow? -- LP formulations of the computability/scheduling problem Motivation: Given that we have a m...
Wednesday, August 31, 2005

Berge: Theory of Graphs

›
It seems that the concept of incidence matrix was started by Kirchoff. Representation of a graph: A graph can be represented as a pair (X,G...
Saturday, August 27, 2005

Index Set Splitting of PUREs

›
(We use the notation of Saouter-Quinton-1203) PURE: a Parametrized Uniform Recurrence Equation. Index set splitting is a transformation that...
Saturday, August 20, 2005

Notes on KMW and DV: chapter4

›
Notation Notation for graphs: KMW call as dependence graph, what we now know as RDG. KMW donot give a name to EDG. KMW call a path as pi. I...
Friday, August 19, 2005

hypergraphs, strongly connected components

›
In a hypergraph constructed in a way mentioned before, we seem to be finding hyper-articulation points (or hyper-articulation edges). The de...
Tuesday, August 16, 2005

All pair shortest paths on directed graphs

›
The textbook algorithms for APSP assume a weighed directed graph. The algorithms are the following: Dijkstra: basically a SSSP for each vert...
Sunday, August 14, 2005

Arvind Sharma's book on Experiential Dimension of Advaita Vedanta

›
Reading the book, The Experiential Dimension of Advaita Vedanta , by Arvind Sharma. This book is dedicated to Eliot Deutsch . The preface i...
‹
›
Home
View web version
Powered by Blogger.