Sciweavers

19866 search results - page 305 / 3974
» Computing all factorizations in ***
Sort
View
IPPS
2006
IEEE
16 years 23 days ago
A simulator for parallel applications with dynamically varying compute node allocation
Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic ef...
Basile Schaeli, B. Gerlach, Roger D. Hersch
IPPS
2006
IEEE
16 years 23 days ago
Reducing reconfiguration time of reconfigurable computing systems in integrated temporal partitioning and physical design framew
In reconfigurable systems, reconfiguration latency is a very important factor impact the system performance. In this paper, a framework is proposed that integrates the temporal pa...
Farhad Mehdipour, Morteza Saheb Zamani, H. R. Ahma...
CSCW
2006
ACM
16 years 21 days ago
SIDES: a cooperative tabletop computer game for social skills development
This paper presents a design case study of SIDES: Shared Interfaces to Develop Effective Social Skills. SIDES is a tool designed to help adolescents with Asperger’s Syndrome pra...
Anne Marie Piper, Eileen O'Brien, Meredith Ringel ...
ICIAP
2005
ACM
16 years 7 days ago
Markovian Energy-Based Computer Vision Algorithms on Graphics Hardware
This paper shows how Markovian segmentation algorithms used to solve well known computer vision problems such as motion estimation, motion detection and stereovision can be signiï¬...
Pierre-Marc Jodoin, Max Mignotte, Jean-Franç...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
16 years 7 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard