rndwalks.blogspot.com
Random Walks in Computer Science: October 2009
http://rndwalks.blogspot.com/2009_10_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Tuesday, October 13, 2009. Open source implementation of queue-based computing. Paradigm is a project aimed at providing framework for development of applications for analytical processing on large-scale data streams, using the model of computation oriented around channeling. Of data streams in appropriate queues with assigned "stream-friendly". Posted by Alek at 4:11 AM. View my complete profile.
rndwalks.blogspot.com
Random Walks in Computer Science: May 2006
http://rndwalks.blogspot.com/2006_05_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Tuesday, May 16, 2006. Random Graphs and the Probabilistic Method. In analysis of Random Graphs, we are especially interested in testing whether the observed graph has a given property. The technique known as the Probabilistic Method. For example, we can demonstrate a outline of simple proof of the following theorem :. A coloring with no monochromatic k-vertex clique. Todo : convert tex formulas into gifs.
rndwalks.blogspot.com
Random Walks in Computer Science: August 2008
http://rndwalks.blogspot.com/2008_08_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Tuesday, August 12, 2008. Complete subgraphs in random graph : a generative approach. Question : "Describe the random graph model M with minimum number of vertices V, having a complete subgraph of size k , with probability p". Posted by Alek at 5:26 AM. View my complete profile. Random jabbering about systems stuff. Queue-based computing : framework for soft real-ti. Back on (research) track.
rndwalks.blogspot.com
Random Walks in Computer Science: October 2008
http://rndwalks.blogspot.com/2008_10_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Saturday, October 11, 2008. After more than a month of day-slicing and hour-saving, I have finally managed to complete the paper I was working on for quite some time, and submit it to 16th Telecommunications Forum (TELFOR) 2008 conference. Title of the paper is " Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs. Posted by Alek at 8:16 AM. View my complete profile. Random Grap...
rndwalks.blogspot.com
Random Walks in Computer Science: November 2005
http://rndwalks.blogspot.com/2005_11_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Wednesday, November 09, 2005. Markov Chains and Random Walks. The fundamental model for studying the behavior of random walks is the model of Markov chains. Markov chain is a discrete-tme stochastic process, that satisfies the "Markovian property", that is, the "memorylessness property" : the future behavior of such process, depends only of its behavior in the current state, not on the past states. The pro...
rndwalks.blogspot.com
Random Walks in Computer Science: May 2009
http://rndwalks.blogspot.com/2009_05_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Friday, May 08, 2009. After a 2 year delay since the original randomNode. Clustering search engine experimental project (and a related paper. Posted by Alek at 4:30 AM. View my complete profile. Random jabbering about systems stuff. Queue-based computing : framework for soft real-ti. Complete subgraphs in random graph : a generative . Back on (research) track. Random Graphs and the Probabilistic Method.
rndwalks.blogspot.com
Random Walks in Computer Science: November 2008
http://rndwalks.blogspot.com/2008_11_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Tuesday, November 25, 2008. Just got back from conference, and here are the slides. This would be a "phase transition" figure bellow for which beta should explode, and all nice properties (existence of 'giant' component, walk convergence, etc) - should disappear. Anyhow . we'll see :) . Meanwhile - you can checkout the paper - here. Stay tuned. ;). Posted by Alek at 1:59 PM. View my complete profile.
rndwalks.blogspot.com
Random Walks in Computer Science: July 2009
http://rndwalks.blogspot.com/2009_07_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Sunday, July 26, 2009. Queue-based computing : framework for soft real-time parallel data analysis. Represents a simple paradigm we stumbled upon in the process of work on voidsearch*. Real time data analysis engine. Let the Q={q 1.q n}. Represents a dynamic set of queues q i. Of fixed size s i. As a arbitrary convolution function of queue elements such that A i(t)=f(A i(t-1),q i). Finally, (Q,D,A,M).
rndwalks.blogspot.com
Random Walks in Computer Science: March 2006
http://rndwalks.blogspot.com/2006_03_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Sunday, March 26, 2006. An invitation to computational learning theory. In the following period I will be overviewing some of the ideas and results from the area of Computational Learning Theory. Learning task , b) sample complexity. And c) time complexity. Of the learning algorithm. Posted by Alek at 4:43 AM. View my complete profile. Random jabbering about systems stuff. Back on (research) track.
rndwalks.blogspot.com
Random Walks in Computer Science: January 2006
http://rndwalks.blogspot.com/2006_01_01_archive.html
Random Walks in Computer Science. Miscelanious thoughts on various computer-science related topics. Sunday, January 01, 2006. Generating Gaussian random numbers. The question is: given a proper generator of uniformly distributed numbers, how does on produce the numbers with Gaussian distribution? The simple and elegant idea is to use the Central Limit Theorem. O the Gaussian probability distribution N(m,o 2). Simply stated : The variable that is a sum of uniformly generated random variables. Random jabbe...