Sciweavers

6800 search results - page 1177 / 1360
» On optimizing collective communication
Sort
View
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
15 years 8 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
FLAIRS
1998
15 years 8 months ago
An AI Approach to Computer Assisted Tomography
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
John F. Kolen, David A. Shamma, Thomas Reichherzer...
OSDI
2000
ACM
15 years 8 months ago
Knit: Component Composition for Systems Software
Knit is a new component definition and linking language for systems code. Knit helps make C code more understandable and reusable by third parties, helps eliminate much of the per...
Alastair Reid, Matthew Flatt, Leigh Stoller, Jay L...
NIPS
1997
15 years 8 months ago
EM Algorithms for PCA and SPCA
I present an expectation-maximization (EM) algorithm for principal component analysis (PCA). The algorithm allows a few eigenvectors and eigenvalues to be extracted from large col...
Sam T. Roweis
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
« Prev « First page 1177 / 1360 Last » Next »