240 search results - page 27 / 48 » Improved Adomian decomposition method |
CDC
2009
IEEE
14 years 7 days ago
2009
IEEE
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
With the increasing use of large image and video archives and high-resolution multimedia data streams in many of today’s research and application areas, there is a growing need f...
CAIP
1999
Springer
13 years 11 months ago
1999
Springer
This paper casts the problem of point-set alignment via Procrustes analysis into a maximum likelihood framework using the EM algorithm. The aim is to improve the robustness of the...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
We demonstrate a framework for improving the availability of cluster based Internet services. Our approach models Internet services as a collection of interconnected components, e...