Sciweavers

15033 search results - page 183 / 3007
» Complexity Theory and Algorithms
Sort
View
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 2 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
15 years 11 months ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
PODS
2011
ACM
229views Database» more  PODS 2011»
14 years 7 months ago
On the complexity of privacy-preserving complex event processing
Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been ad...
Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Nau...
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
16 years 4 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
MM
2004
ACM
109views Multimedia» more  MM 2004»
15 years 9 months ago
Loss-resilient on-demand media streaming using priority encoding
A novel solution to the reliable multicast problem is the “digital fountain” approach, in which data is encoded with an erasure protection code before transmission, and receiv...
Cheng Huang, Ramaprabhu Janakiraman, Lihao Xu