2432 search results - page 257 / 487 » Using simple abstraction to reinvent computing for paralleli... |
165
click to vote
CONCUR
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We define a language for Web services contracts as a parallelfree fragment of ccs and we study a natural notion of compliance between clients and services in terms of th...
152
click to vote
CHES
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This paper describes the methodology and design of a scalable Montgomery multiplication module. There is no limitation on the maximum number of bits manipulated by the mu...
139
click to vote
DEDS
2010
15 years 3 months ago
2010
Abstract We present an optimal timing control formulation for the problem of controlling autonomous puppets. In particular, by appropriately timing the different movements, entire ...
137
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
158
click to vote
NLUCS
2008
15 years 7 months ago
2008
Abstract. To develop a computational model of understanding spatial expressions, various factors should be taken into account. We have been exploring the relations between the good...