Sciweavers

1943 search results - page 339 / 389
» Ordering Default Theories
Sort
View
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 6 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
16 years 6 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
SIGMOD
2008
ACM
162views Database» more  SIGMOD 2008»
16 years 6 months ago
Event queries on correlated probabilistic streams
A major problem in detecting events in streams of data is that the data can be imprecise (e.g. RFID data). However, current state-ofthe-art event detection systems such as Cayuga ...
Christopher Ré, Dan Suciu, Julie Letchner, ...
PODS
2001
ACM
148views Database» more  PODS 2001»
16 years 6 months ago
On the Design and Quantification of Privacy Preserving Data Mining Algorithms
The increasing ability to track and collect large amounts of data with the use of current hardware technology has lead to an interest in the development of data mining algorithms ...
Dakshi Agrawal, Charu C. Aggarwal
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei