Sciweavers

7040 search results - page 1020 / 1408
» The Single Model Principle
Sort
View
CCS
2008
ACM
15 years 8 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
WSC
1997
15 years 8 months ago
A Virtual PNNI Network Testbed
We describe our experiences designing and implementing a virtual PNNI network testbed. The network elements and signaling protocols modeled are consistent with the ATM Forum PNNI ...
Kalyan S. Perumalla, Matthew Andrews, Sandeep N. B...
GPEM
2008
128views more  GPEM 2008»
15 years 6 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
201
Voted
JMLR
2008
151views more  JMLR 2008»
15 years 6 months ago
Learning to Combine Motor Primitives Via Greedy Additive Regression
The computational complexities arising in motor control can be ameliorated through the use of a library of motor synergies. We present a new model, referred to as the Greedy Addit...
Manu Chhabra, Robert A. Jacobs
TIP
2008
107views more  TIP 2008»
15 years 6 months ago
Sampling-Based Correlation Estimation for Distributed Source Coding Under Rate and Complexity Constraints
In many practical distributed source coding (DSC) applications, correlation information has to be estimated at the encoder in order to determine the encoding rate. Coding efficien...
Ngai-Man Cheung, Huisheng Wang, Antonio Ortega
« Prev « First page 1020 / 1408 Last » Next »