Sciweavers

107 search results - page 3 / 22
» An incremental algorithm for computing ranked full disjuncti...
Sort
View
TIP
2010
119views more  TIP 2010»
12 years 12 months ago
Software Designs of Image Processing Tasks With Incremental Refinement of Computation
Software realizations of computationally-demanding image processing tasks (e.g. image transforms and convolution) do not currently provide graceful degradation when their clock-cy...
Davide Anastasia, Yiannis Andreopoulos
PODS
2012
ACM
276views Database» more  PODS 2012»
11 years 7 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
EDBT
2010
ACM
246views Database» more  EDBT 2010»
14 years 1 days ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
POPL
2009
ACM
14 years 5 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
AAAI
2006
13 years 6 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer