Sciweavers

1662 search results - page 64 / 333
» Privately Finding Specifications
Sort
View
134
Voted
JCIT
2010
174views more  JCIT 2010»
14 years 9 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
156
Voted
CIKM
2006
Springer
15 years 6 months ago
Summarizing local context to personalize global web search
The PC Desktop is a very rich repository of personal information, efficiently capturing user's interests. In this paper we propose a new approach towards an automatic persona...
Paul-Alexandru Chirita, Claudiu S. Firan, Wolfgang...
JOC
2010
123views more  JOC 2010»
14 years 9 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
BIOINFORMATICS
2010
87views more  BIOINFORMATICS 2010»
15 years 2 months ago
Discriminatory power of RNA family models
Motivation: RNA family models group nucleotide sequences that share a common biological function. These models can be used to find new sequences belonging to the same family. To s...
Christian Höner zu Siederdissen, Ivo L. Hofac...
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
15 years 2 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...