21324 search results - page 547 / 4265 » Making the case for computing |
192
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
184
click to vote
ECUMN
2007
Springer
16 years 1 months ago
2007
Springer
This article presents a novel method for computing distances between hosts in a computational Grid. Our method allows to represent the cost to achieve any operation involving some...
194
click to vote
CF
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we present a programming language viewpoint for morphogenesis, the process of shape formation during embryological development. Specifically, we model morphogenesi...
206
click to vote
ICCV
2003
IEEE
16 years 15 days ago
2003
IEEE
This paper addresses the problem of computing the trajectory of a camera from sparse positional measurements that have been obtained from visual localisation, and dense differenti...
171
click to vote
ACSC
2002
IEEE
16 years 5 days ago
2002
IEEE
This paper describes the use of the reflective journal in a computer programming course at the University of South Australia. We describe rationale for the journal relating it to ...