Sciweavers

1699 search results - page 323 / 340
» A Rule Format for Associativity
Sort
View
148
Voted
SAC
2010
ACM
15 years 10 months ago
Background knowledge in formal concept analysis: constraints via closure operators
The aim of this short paper is to present a general method of using background knowledge to impose constraints in conceptual clustering of object-attribute relational data. The pr...
Radim Belohlávek, Vilém Vychodil
FC
2009
Springer
150views Cryptology» more  FC 2009»
15 years 10 months ago
Privacy-Preserving Information Markets for Computing Statistical Data
Abstract. Consider an “information market” where private and potentially sensitive data are collected, treated as commodity and processed into aggregated information with comme...
Aggelos Kiayias, Bülent Yener, Moti Yung
145
Voted
TLCA
2009
Springer
15 years 10 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
129
Voted
DOCENG
2009
ACM
15 years 10 months ago
Web document text and images extraction using DOM analysis and natural language processing
: © Web Document Text and Images Extraction using DOM Analysis and Natural Language Processing Parag Mulendra Joshi, Sam Liu HP Laboratories HPL-2009-187 Web page text extraction,...
Parag Mulendra Joshi, Sam Liu
141
Voted
RECSYS
2009
ACM
15 years 10 months ago
Latent dirichlet allocation for tag recommendation
Tagging systems have become major infrastructures on the Web. They allow users to create tags that annotate and categorize content and share them with other users, very helpful in...
Ralf Krestel, Peter Fankhauser, Wolfgang Nejdl