1425 search results - page 12 / 285 » Beyond Dependency Graphs |
LCPC
1991
Springer
15 years 1 months ago
1991
Springer
The dependence ow graph is a novel intermediate representation for optimizingand parallelizing compilersthat can be viewed as an executable representation of program dependences. ...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
82
Voted
CSL
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
ICCSA
2007
Springer
15 years 3 months ago
2007
Springer
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We study truthful mechanisms for auctions in which the auctioneer is trying to hire a team of agents to perform a complex task, and paying them for their work. As common in the ...