614 search results - page 74 / 123 » Local Computation: Lower and Upper Bounds |
COMPGEOM
2003
ACM
15 years 3 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
MANSCI
2006
14 years 10 months ago
2006
We present a new approach to pricing American-style derivatives that is applicable to any Markovian setting (i.e., not limited to geometric Brownian motion) for which European cal...
MST
2011
14 years 4 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
IPL
2002
14 years 9 months ago
2002
Restricted rotation distance between pairs of rooted binary trees measures differences in tree shape and is related to rotation distance. In restricted rotation distance, the rota...