Sciweavers

152 search results - page 9 / 31
» Equations over Sets of Natural Numbers with Addition Only
Sort
View
SC
1995
ACM
15 years 2 months ago
Predicting Application Behavior in Large Scale Shared-memory Multiprocessors
In this paper we present an analytical-based framework for parallel program performance prediction. The main thrust of this work is to provide a means for treating realistic appli...
Karim Harzallah, Kenneth C. Sevcik
TNN
1998
114views more  TNN 1998»
14 years 10 months ago
Bayesian retrieval in associative memories with storage errors
Abstract—It is well known that for finite-sized networks, onestep retrieval in the autoassociative Willshaw net is a suboptimal way to extract the information stored in the syna...
Friedrich T. Sommer, Peter Dayan
ENTCS
2006
114views more  ENTCS 2006»
14 years 11 months ago
What is algebraic in process theory?
This is an extended version of an essay with the same title that I wrote for the workshop Algebraic Process Calculi: The First Twenty Five Years and Beyond, held in Bertinoro, Ita...
Bas Luttik
FOCS
2002
IEEE
15 years 4 months ago
Covering Problems with Hard Capacities
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
Julia Chuzhoy, Joseph Naor
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...