Sciweavers

7796 search results - page 194 / 1560
» On Generalized Schur Numbers
Sort
View
IACR
2011
88views more  IACR 2011»
14 years 6 months ago
Targeted Malleability: Homomorphic Encryption for Restricted Computations
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
Dan Boneh, Gil Segev, Brent Waters
RECOMB
2003
Springer
16 years 7 months ago
Finding recurrent sources in sequences
Many genomic sequences and, more generally, (multivariate) time series display tremendous variability. However, often it is reasonable to assume that the sequence is actually gene...
Aristides Gionis, Heikki Mannila
WEA
2007
Springer
112views Algorithms» more  WEA 2007»
16 years 22 days ago
Crossing Minimization in Weighted Bipartite Graphs
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
Olca A. Çakiroglu, Cesim Erten, Ömer K...
DEXA
2004
Springer
190views Database» more  DEXA 2004»
16 years 11 hour ago
On Efficient and Effective Association Rule Mining from XML Data
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, A. Mi...
NIPS
1994
15 years 8 months ago
On-line Learning of Dichotomies
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
N. Barkai, H. Sebastian Seung, Haim Sompolinsky