Sciweavers

317 search results - page 58 / 64
» The Open University Linked Data - data.open.ac.uk
Sort
View
BMCBI
2006
118views more  BMCBI 2006»
15 years 6 months ago
Exploration of biological network centralities with CentiBiN
Background: The elucidation of whole-cell regulatory, metabolic, interaction and other biological networks generates the need for a meaningful ranking of network elements. Central...
Björn H. Junker, Dirk Koschützki, Falk S...
WWW
2009
ACM
16 years 6 months ago
Purely URL-based topic classification
Given only the URL of a web page, can we identify its topic? This is the question that we examine in this paper. Usually, web pages are classified using their content [7], but a U...
Eda Baykan, Monika Rauch Henzinger, Ludmila Marian...
WWW
2006
ACM
16 years 6 months ago
Invisible participants: how cultural capital relates to lurking behavior
The asymmetry of activity in virtual communities is of great interest. While participation in the activities of virtual communities is crucial for a community's survival and ...
Vladimir Soroka, Sheizaf Rafaeli
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 6 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 6 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman