2168 search results - page 57 / 434 » Randomized Algorithms and Complexity Theory |
102
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Graphs are canonical examples of high-dimensional non-Euclidean data sets, and are emerging as a common data structure in many fields. While there are many algorithms to analyze ...
121
click to vote
IM
2007
15 years 2 months ago
2007
In this paper we suggest evaluating the importance of a website with the mean frequency of visiting the website for the Markov chain on the Internet Graph describing random surfi...
122
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
109
click to vote
ALGORITHMS
2010
15 years 10 days ago
2010
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
117
click to vote
IJCNN
2007
IEEE
15 years 9 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...