Sciweavers

2031 search results - page 237 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
CCS
2009
ACM
15 years 10 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
15 years 7 months ago
Optimally Reconstructing Weighted Graphs Using Queries
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
Hanna Mazzawi
DEBS
2009
ACM
15 years 4 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
MM
2009
ACM
197views Multimedia» more  MM 2009»
15 years 4 months ago
Visual summaries of popular landmarks from community photo collections
We present a novel data-driven algorithm that leverages online image repositories such as Flickr for automatically generating tourist maps. Our hypothesis is that, given a large e...
Wei-Chao Chen, Agathe Battestini, Natasha Gelfand,...
FOCS
2007
IEEE
15 years 4 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin