17760 search results - page 228 / 3552 » A Generalization of the Massey-Ding Algorithm |
189
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
197
Voted
PODS
2010
ACM
16 years 5 days ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
199
click to vote
JDA
2006
15 years 7 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
165
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
192
Voted
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—Designing efficient scheduling algorithms is an important problem in a general class of networks with resourcesharing constraints, such as wireless networks and stochastic proc...