Sciweavers

29908 search results - page 228 / 5982
» On the complexity of communication complexity
Sort
View
RECOMB
2007
Springer
16 years 6 months ago
Reconstructing an Inversion History in the Anopheles Gambiae Complex
Ai Xia, Maria V. Sharakhova, Igor V. Sharakhov
STOC
2007
ACM
108views Algorithms» more  STOC 2007»
16 years 6 months ago
Combinatorial complexity in O-minimal geometry
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets i...
Saugata Basu
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
16 years 6 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
16 years 3 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
FLOPS
2010
Springer
16 years 1 months ago
Complexity Analysis by Graph Rewriting
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
Martin Avanzini, Georg Moser