1023 search results - page 194 / 205 » Graph model selection using maximum likelihood |
ALGORITHMICA
2011
12 years 11 months ago
2011
Algorithms for determining quality/cost/price tradeoffs in saturated markets are consid-3 ered. A product is modeled by d real-valued qualities whose sum determines the unit cost ...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
ICIP
1995
IEEE
13 years 11 months ago
1995
IEEE
This paper develops an error bound for narrow bandwidth Gabor filters synthesized using multiple stages. It is shown that the error introduced by approximating narrow bandwidth Ga...
MSWIM
2006
ACM
14 years 1 months ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...