Sciweavers

402 search results - page 27 / 81
» Cryptosystems using Linear Groups
Sort
View
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
13 years 11 days ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
CVPR
2009
IEEE
1696views Computer Vision» more  CVPR 2009»
16 years 5 months ago
Fast Normalized Cut with Linear Constraints
Normalized Cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be ap...
Linli Xu (University of Alberta), Wenye Li (Univer...
CORR
2002
Springer
123views Education» more  CORR 2002»
14 years 9 months ago
Ideal decompositions and computation of tensor normal forms
Abstract. Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[Sr] of a symmetric group Sr. If for a class of tenso...
Bernd Fiedler
BMCBI
2008
146views more  BMCBI 2008»
14 years 10 months ago
A phase synchronization clustering algorithm for identifying interesting groups of genes from cell cycle expression data
Background: The previous studies of genome-wide expression patterns show that a certain percentage of genes are cell cycle regulated. The expression data has been analyzed in a nu...
Chang Sik Kim, Cheol Soo Bae, Hong Joon Tcha
ICONIP
2007
14 years 11 months ago
Discovery of Linear Non-Gaussian Acyclic Models in the Presence of Latent Classes
Abstract. An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled ...
Shohei Shimizu, Aapo Hyvärinen