1477 search results - page 185 / 296 » Complexity of (iterated) dominance |
106
click to vote
FCCM
1997
IEEE
15 years 5 months ago
1997
IEEE
Square root operation is hard to implement on FPGAs because of the complexity of the algorithms. In this paper, we present a non-restoring square root algorithm and two very simpl...
KDD
1998
ACM
15 years 5 months ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
165
click to vote
CVRMED
1997
Springer
15 years 4 months ago
1997
Springer
In this paper we address the problem of extracting geometric models from low contrast volumetric images, given a template or reference shape of that model. We proceed by deforming...
133
click to vote
MICRO
1992
IEEE
15 years 4 months ago
1992
IEEE
Software pipelining is an important instruction scheduling technique for efficiently overlapping successive iterations of loops and executing them in parallel. Modulo scheduling i...
94
Voted
KR
1989
Springer
15 years 4 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...