Sciweavers

1439 search results - page 13 / 288
» Fast approximation of centrality
Sort
View
STOC
2002
ACM
81views Algorithms» more  STOC 2002»
14 years 11 months ago
Fast, small-space algorithms for approximate histogram maintenance
Anna C. Gilbert, Sudipto Guha, Piotr Indyk, Yannis...
NA
2006
59views more  NA 2006»
13 years 10 months ago
On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory
When constructing multivariate Pad
Stefan Becuwe, Annie A. M. Cuyt
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 11 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 1 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 7 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White