503 search results - page 64 / 101 » Probabilistic Weighted Automata |
132
click to vote
IJFCS
2002
15 years 2 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
138
click to vote
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
The ability to deal with uncertain information is becoming increasingly important for modern database applications. Whereas a conventional (certain) object is usually represented ...
123
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
157
click to vote
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— Autonomous vehicle navigation in dynamic urban environments requires localization accuracy exceeding that available from GPS-based inertial guidance systems. We have shown prev...
130
click to vote
WINET
2010
15 years 1 months ago
2010
Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...