Sciweavers

21324 search results - page 454 / 4265
» Making the case for computing
Sort
View
CSL
2005
Springer
16 years 16 days ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
CP
2004
Springer
16 years 12 days ago
Computing the Frequency of Partial Orders
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
Marc R. C. van Dongen
WEBI
2004
Springer
16 years 10 days ago
A Web-Based Intelligent Tutoring System for Computer Programming
Web Intelligence is a direction for scientific research that explores practical applications of Artificial Intelligence to the next generation of Web-empowered systems. In this ...
Cory J. Butz, Shan Hua, R. Brien Maguire
FDL
2003
IEEE
16 years 9 days ago
Using Rewriting-Logic Notation for Funcional Verification in Data-Stream Based Reconfigurable Computing
Reconfigurable Systolic Arrays are a generalization of Systolic Arrays where node operations and interconnections can be redefined even at run time. This flexibility increases the...
Mauricio Ayala-Rincón, Ricardo P. Jacobi, C...
EUSAI
2003
Springer
16 years 7 days ago
Towards Computer Understanding of Human Interactions
People meet in order to interact - disseminating information, making decisions, and creating new ideas. Automatic analysis of meetings is therefore important from two points of vie...
Iain McCowan, Daniel Gatica-Perez, Samy Bengio, Da...