Sciweavers

359 search results - page 34 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
ISCAPDCS
2003
13 years 10 months ago
Efficient Data Allocation for a Cluster of Workstations
The development and use of cluster based computing is increasingly becoming an effective approach for solving high performance computing problems. The trend of moving away from sp...
Ahmed M. Mohamed, Reda A. Ammar, Lester Lipsky
FOCS
2000
IEEE
14 years 1 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
ICPR
2004
IEEE
14 years 10 months ago
Registration of an Uncalibrated Image Pair to a 3D Surface Model
The following data fusion problem is considered: Given a 3D geometric model of an object and two uncalibrated images of the same object, and assuming that the object surface is te...
Dmitry Chetverikov, Zsolt Jankó
CSB
2003
IEEE
150views Bioinformatics» more  CSB 2003»
14 years 2 months ago
Algorithms for Bounded-Error Correlation of High Dimensional Data in Microarray Experiments
The problem of clustering continuous valued data has been well studied in literature. Its application to microarray analysis relies on such algorithms as -means, dimensionality re...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
14 years 1 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...