2239 search results - page 75 / 448 » Computing with abstract matrix structures |
164
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...
174
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
179
click to vote
ICA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
176
click to vote
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
169
click to vote
EUROCRYPT
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...