Sciweavers

99 search results - page 20 / 20
» Inspection by Implicit Polynomials
Sort
View
244
Voted
KDD
2010
ACM
245views Data Mining» more  KDD 2010»
15 years 10 months ago
Flexible constrained spectral clustering
Constrained clustering has been well-studied for algorithms like K-means and hierarchical agglomerative clustering. However, how to encode constraints into spectral clustering rem...
Xiang Wang, Ian Davidson
SIAMSC
2008
140views more  SIAMSC 2008»
15 years 7 months ago
Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier--Stokes Equations
We study preconditioners for the iterative solution of the linear systems arising in the implicit time integration of the compressible Navier-Stokes equations. The spatial discreti...
Per-Olof Persson, Jaime Peraire
JACM
2000
73views more  JACM 2000»
15 years 7 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 1 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler