The Advaith

Brahma Satyam Jagan Mithya Jeevo Brahmaiva Na Parah

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...
Friday, August 12, 2005

ability to multiplex - duality and non-duality

›
It seems the ability to multiplex thoughts seems to come naturally, except for some periods when there is a single thought. It also seems th...
Wednesday, August 10, 2005

unitarization and directed hypergraphs: more thoughts

›
It is clear that unitarization results in a directed hypergraph. Also, a zero-weight cycle is a path from a vertex to itself. Fact: if the g...
Sunday, August 07, 2005

Software Pipelining and unarization

›
It seems that, unarization can be applied to small loops very effectively. -- It also seems that the technique can be applied to 1-d loops a...

Siddhartha by Hesse: Final Chapter - Govinda

›
I have nothing to say but to redirect to the chapter "Govinda" from Siddhartha by Herman Hesse. I am just feeling the way Sanjaya...
Wednesday, August 03, 2005

Atri-DattaAtreya and Vyasa-Suka: a comparision

›
Both Dattaatreya and Suka are sons of well known sages in Hindu puranas. The concept of son itself has a hidden meaning, as in other familia...
Tuesday, August 02, 2005

checking for the validity of a transformation on unitary graphs

›
Given a d-dimensional vector and a computation on the vector, what are the problems that can be solved fastly? If we are also given that the...
Tuesday, July 26, 2005

hardness of the URE/SURE scheduling

›
The input to a SURE scheduling problem is a (n+d)*m matrix, and we are to find the minimum running time of the system (with a reasonable ag...
Sunday, July 24, 2005

A data structural approach to detect cycles

›
Refer to the previous post about the construction of the hypergraph with ordinary nodes and hypernodes. The ordinary nodes correspond to the...
‹
›
Home
View web version
Powered by Blogger.