1347 search results - page 131 / 270 » On the Structure of the Minimum Time Function |
108
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
139
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
129
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
186
Voted
IEEEHPCS
2010
14 years 11 months ago
2010
Intelligent sensor selection for monitoring operations is one of the serious subjects to reduce information processing time and increase information fusion accuracy. This paper at...
103
click to vote
ICML
2002
IEEE
16 years 4 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...