19866 search results - page 339 / 3974 » Computing all factorizations in *** |
204
click to vote
ECCC
2010
15 years 5 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
163
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
161
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
173
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...
209
click to vote
CSDA
2004
15 years 6 months ago
2004
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...