Sciweavers

477 search results - page 31 / 96
» The Case For Personal Computers As Workstations
Sort
View
ENGL
2008
186views more  ENGL 2008»
13 years 7 months ago
High Performance Monte-Carlo Based Option Pricing on FPGAs
High performance computing is becoming increasingly important in the field of financial computing, as the complexity of financial models continues to increase. Many of these financ...
Xiang Tian, Khaled Benkrid, Xiaochen Gu
WORDS
2003
IEEE
14 years 28 days ago
Improving Dependability of Service Oriented Architectures for Pervasive Computing
Service Oriented Programming - which combines Distributed Object Compunting, Component Based and webbased concepts - has recently emerged as a promising approach to develop dynami...
Domenico Cotroneo, Cristiano di Flora, Stefano Rus...
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
SIGMOD
2009
ACM
197views Database» more  SIGMOD 2009»
14 years 8 months ago
Secure kNN computation on encrypted databases
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...
Wai Kit Wong, David Wai-Lok Cheung, Ben Kao, Nikos...
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer