JVM
2001
13 years 5 months ago
2001
ompiler for Many Memory Models { extended abstract Samuel P. Midki IBM TJ Watson Research Jaejin Lee Dept. of Computer Science and Engineering, Michigan State University David A. P...
ICHIM
2001
13 years 5 months ago
2001
One of the outcomes of Moore's Law - according to which the exponential growth of technical advances in computer science is pushing more and more of our computers into obsole...
ACE
2003
13 years 5 months ago
2003
We describe our experiences in setting up a new Computer Science department in an established University within the UK. We drew upon our experiences in teaching Computing in Austr...
IADIS
2004
2004
Implementing Cognitive Modellig in CS Education: Aligning Theory and Practice of Learning to Program
13 years 5 months ago
It can be argued that although computer science may seem one of the best researched areas, it could also be one of the worst taught. In this research we examine the residual probl...
CCCG
2006
13 years 5 months ago
2006
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends in Compute...
CLA
2004
13 years 5 months ago
2004
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
ACST
2006
13 years 5 months ago
2006
In this paper, we propose a novel algorithm for directional temporal texture synthesis. The generated temporal textures can move in any user-specified direction at run time, while...
ACST
2006
13 years 5 months ago
2006
Including mathematical expressions in documents can be a tiresome and difficult process. A recognition system for handwritten mathematical expressions would greatly simplify the t...
ACST
2006
13 years 5 months ago
2006
This paper investigates the applicability of distributed clustering technique, called RACHET [1], to organize large sets of distributed text data. Although the authors of RACHET c...
ACST
2006
13 years 5 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...