Sciweavers

2969 search results - page 314 / 594
» A space efficient algorithm for group structure computation
Sort
View
126
Voted
ICPR
2002
IEEE
15 years 9 months ago
A Large Scale Clustering Scheme for Kernel K-Means
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
Rong Zhang, Alexander I. Rudnicky
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 4 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
ISBI
2009
IEEE
15 years 11 months ago
Image-Driven Population Analysis Through Mixture Modeling
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...
Mert R. Sabuncu
VIS
2009
IEEE
211views Visualization» more  VIS 2009»
16 years 6 months ago
Isosurface Extraction and View-Dependent Filtering from Time-Varying Fields Using Persistent Time-Octree (PTOT)
We develop a new algorithm for isosurface extraction and view-dependent filtering from large time-varying fields, by using a novel Persistent Time-Octree (PTOT) indexing structure....
Cong Wang, Yi-Jen Chiang
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 6 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis