Sciweavers

478 search results - page 29 / 96
» A simple expected running time analysis for randomized
Sort
View
KDD
2006
ACM
200views Data Mining» more  KDD 2006»
14 years 8 months ago
A Random-Walk Based Scoring Algorithm Applied to Recommender Engines
Recommender systems are an emerging technology that helps consumers find interesting products and useful resources. A recommender system makes personalized product suggestions by e...
Augusto Pucci, Marco Gori, Marco Maggini
INFOCOM
2011
IEEE
13 years 5 days ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...
ECCV
2006
Springer
14 years 10 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with som...
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 11 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
DCC
2008
IEEE
14 years 8 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev