2455 search results - page 131 / 491 » Computability of Models for Sequence Assembly |
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
HCW
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
FECS
2006
13 years 10 months ago
2006
Improving the quality of student thinking should be given a high priority in any educational system as good thinking is essential in meeting the challenges of living in a rapidly ...
SYNASC
2008
IEEE
14 years 3 months ago
2008
IEEE
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
CRV
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper proposes an approach to compute viewnormalized body part trajectories of pedestrians from monocular video sequences. The proposed approach first extracts the 2D trajec...