Sciweavers

1686 search results - page 38 / 338
» Programs as polygraphs: computability and complexity
Sort
View
FOCS
2007
IEEE
15 years 4 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
COMPUTER
2010
127views more  COMPUTER 2010»
14 years 7 months ago
Data Stream Management Systems for Computational Finance
Computational finance leverages computer technologies to build models from large amounts of data to extract insight. In today's networked world, the amount of data available t...
Badrish Chandramouli, Mohamed H. Ali, Jonathan Gol...
86
Voted
AML
1998
60views more  AML 1998»
14 years 9 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
FPL
2010
Springer
188views Hardware» more  FPL 2010»
14 years 7 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
SIGCSE
2004
ACM
112views Education» more  SIGCSE 2004»
15 years 3 months ago
Great principles in computing curricula
The nearly three dozen core technologies of computing sit in a simple framework defined by great principles and by computing practices. The great principles are of two kinds, mech...
Peter J. Denning