Sciweavers

1541 search results - page 269 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
DAS
2008
Springer
13 years 9 months ago
Super-Resolution of Text Images Using Edge-Directed Tangent Field
This paper presents an edge-directed super-resolution algorithm for gray level document images without using any training set. This technique creates an image with smooth regions ...
Jyotirmoy Banerjee, C. V. Jawahar
SMA
2008
ACM
110views Solid Modeling» more  SMA 2008»
13 years 8 months ago
Probabilistic model of triangulation
This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any p...
Xiaoyun Li, David K. Hunter
WWW
2003
ACM
14 years 8 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
WAW
2004
Springer
150views Algorithms» more  WAW 2004»
14 years 1 months ago
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
13 years 11 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra