Sciweavers

151 search results - page 27 / 31
» Computing in Solvable Matrix Groups
Sort
View
CVPR
2003
IEEE
14 years 11 months ago
Kernel Principal Angles for Classification Machines with Applications to Image Sequence Interpretation
We consider the problem of learning with instances defined over a space of sets of vectors. We derive a new positive definite kernel f(A B) defined over pairs of matrices A B base...
Lior Wolf, Amnon Shashua
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 9 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
EC
2006
163views ECommerce» more  EC 2006»
13 years 9 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe
BMCBI
2008
108views more  BMCBI 2008»
13 years 9 months ago
SPRINT: A new parallel framework for R
Background: Microarray analysis allows the simultaneous measurement of thousands to millions of genes or sequences across tens to thousands of different samples. The analysis of t...
Jon Hill, Matthew Hambley, Thorsten Forster, Murie...
IPPS
1999
IEEE
14 years 1 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...