Sciweavers

1541 search results - page 161 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
13 years 6 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
CVPR
2011
IEEE
13 years 2 days ago
Entropy Rate Superpixel Segmentation
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
Ming-Yu Liu, Oncel Tuzel, Srikumar Ramalingam, Ram...
DAC
2009
ACM
14 years 3 months ago
Accurate temperature estimation using noisy thermal sensors
Multicore SOCs rely on runtime thermal measurements using on-chip sensors for DTM. In this paper we address the problem of estimating the actual temperature of on-chip thermal sen...
Yufu Zhang, Ankur Srivastava
SPAA
1996
ACM
14 years 14 days ago
An Analysis of Dag-Consistent Distributed Shared-Memory Algorithms
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...
Robert D. Blumofe, Matteo Frigo, Christopher F. Jo...
SSIAI
2002
IEEE
14 years 1 months ago
Two Dimensional Projective Point Matching
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...
Jason Denton, J. Ross Beveridge