Sciweavers

2600 search results - page 145 / 520
» Clustering with or without the Approximation
Sort
View
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...
ASC
2007
15 years 6 months ago
An approximate stability analysis of nonlinear systems described by Universal Learning Networks
Stability is one of the most important subjects in control systems. As for the stability of nonlinear dynamical systems, Lyapunov’s direct method and linearized stability analys...
Kotaro Hirasawa, Shingo Mabu, Shinji Eto, Jinglu H...
MST
2010
187views more  MST 2010»
15 years 1 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
GIS
2008
ACM
16 years 7 months ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
16 years 6 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor