400 search results - page 44 / 80 » Approximation Stability and Boosting |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
Abstract— The sparsification of the reluctance matrix L−1 (where L denotes the usual inductance matrix L) has been widely used in several recent investigations to make the pro...
GIS
2007
ACM
14 years 9 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
TSP
2010
13 years 2 months ago
2010
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...