Sciweavers

2740 search results - page 182 / 548
» Approximating Component Selection
Sort
View
134
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 3 months ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
ICDAR
2009
IEEE
15 years 10 months ago
Drop Caps Decomposition for Indexing a New Letter Extraction Method
This paper presents a new method to extract shapes in drop caps and particularly the most important shape: Letter itself. This method relies on a combination of a Aujol and Chambo...
Mickaël Coustaty, Jean-Marc Ogier, Rudolf Par...
AIIDE
2009
15 years 4 months ago
Case-Based Reasoning for Build Order in Real-Time Strategy Games
We present a case-based reasoning technique for selecting build orders in a real-time strategy game. The case retrieval process generalizes features of the game state and selects ...
Ben George Weber, Michael Mateas
125
Voted
PAMI
1998
94views more  PAMI 1998»
15 years 2 months ago
Bayesian Approaches to Gaussian Mixture Modeling
—A Bayesian-based methodology is presented which automatically penalizes overcomplex models being fitted to unknown data. We show that, with a Gaussian mixture model, the approac...
Stephen J. Roberts, Dirk Husmeier, Iead Rezek, Wil...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 4 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu