2239 search results - page 87 / 448 » Computing with abstract matrix structures |
108
click to vote
NIPS
2004
15 years 1 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
SIAMIS
2008
14 years 11 months ago
2008
In this paper we consider the problem of locating a small three-dimensional elastic inclusion, using arrays of elastic source transmitters and receivers. This procedure yields the ...
MICS
2010
14 years 6 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
192
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract-- In this paper, we propose secure protocols to perform Singular Value Decomposition (SVD) for two parties over horizontally and vertically partitioned data. We propose va...