400 search results - page 19 / 80 » Approximation Stability and Boosting |
CCR
2008
13 years 8 months ago
2008
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
ENTCS
2008
13 years 7 months ago
2008
We give a general method for showing that all numberings of certain effective algebras are recursively equivalent. The method is based on computable approximation-limit pairs. The...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
SIGMOD
2010
ACM
14 years 19 days ago
2010
ACM
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...