15073 search results - page 349 / 3015 » Probabilistic algorithms for computing resultants |
143
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
The multi-pattern scheduling algorithm is designed to schedule a graph onto a coarse-grained reconfigurable architecture, the result of which depends highly on the used patterns....
104
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This article deals with an Oriented-Contour Point based voting algorithm for multiclass vehicle type identification (make and model). The system obtains similar results for equiva...
133
Voted
JSC
2007
15 years 4 months ago
2007
A well-known result due to J. T. Stafford asserts that a stably free left module M over the Weyl algebras D = An(k) or Bn(k) − where k is a field of characteristic 0 − with ...
179
Voted
MSWIM
2003
ACM
15 years 10 months ago
2003
ACM
Mobile Ad-Hoc Networks (MANETS) are networks of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems i...
169
Voted
JAIR
2008
15 years 5 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...