359 search results - page 34 / 72 » Solving Geometric Covering Problems by Data Reduction |
141
Voted
ISCAPDCS
2003
15 years 5 months ago
2003
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...
184
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
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...
131
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
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...
128
Voted
CSB
2003
IEEE
15 years 9 months ago
2003
IEEE
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...
139
Voted
KDD
2009
ACM
15 years 8 months ago
2009
ACM
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...