Sciweavers

2680 search results - page 126 / 536
» The topology of the independence complex
Sort
View
COLT
1993
Springer
15 years 5 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 3 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
BMCBI
2007
181views more  BMCBI 2007»
15 years 1 months ago
Versatile annotation and publication quality visualization of protein complexes using POLYVIEW-3D
Background: Macromolecular visualization as well as automated structural and functional annotation tools play an increasingly important role in the post-genomic era, contributing ...
Aleksey A. Porollo, Jaroslaw Meller
204
Voted
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 2 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
COCOON
2007
Springer
15 years 7 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...