Sciweavers

3367 search results - page 247 / 674
» Incremental assignment problem
Sort
View
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 6 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
FOSSACS
2009
Springer
15 years 10 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr
UAI
2001
15 years 5 months ago
A Logic for Reasoning about Upper Probabilities
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...
Joseph Y. Halpern, Riccardo Pucella
MM
2010
ACM
157views Multimedia» more  MM 2010»
15 years 4 months ago
Landmark image retrieval using visual synonyms
In this paper, we consider the incoherence problem of the visual words in bag-of-words vocabularies. Different from existing work, which performs assignment of words based solely ...
Efstratios Gavves, Cees G. M. Snoek
ECCC
2010
111views more  ECCC 2010»
15 years 4 months ago
Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
Venkatesan Guruswami, Yuan Zhou