Sciweavers

8298 search results - page 169 / 1660
» On the Complexity of Numerical Analysis
Sort
View
CCS
2008
ACM
15 years 9 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
ICDE
2006
IEEE
125views Database» more  ICDE 2006»
16 years 1 months ago
Towards a Quality Model for Effective Data Selection in Collaboratories
Data-driven scientific applications utilize workflow frameworks to execute complex dataflows, resulting in derived data products of unknown quality. We discuss our on-going resear...
Yogesh Simmhan, Beth Plale, Dennis Gannon
ICC
2000
IEEE
105views Communications» more  ICC 2000»
15 years 11 months ago
FDMA Capacity of the Gaussian Multiple Access Channel With ISI
— This paper proposes a numerical method for characterizing the achievable rate region for a Gaussian multiple access channel with ISI under the frequency division multiple acces...
Wei Yu, John M. Cioffi
AIPS
2007
15 years 9 months ago
Structural Patterns of Tractable Sequentially-Optimal Planning
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
Michael Katz, Carmel Domshlak
AMDO
2008
Springer
15 years 9 months ago
Inverse Kinematics Using Sequential Monte Carlo Methods
Abstract. In this paper we propose an original approach to solve the Inverse Kinematics problem. Our framework is based on Sequential Monte Carlo Methods and has the advantage to a...
Nicolas Courty, Elise Arnaud