9209 search results - page 298 / 1842 » Data Space Randomization |
191
click to vote
GMP
2008
IEEE
16 years 1 months ago
2008
IEEE
We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
140
click to vote
SIGOPSE
2004
ACM
16 years 2 days ago
2004
ACM
Abstract: Designing and managing dependable systems is a difficult endeavor. In this paper, we describe challenges in this vast problem space, including provisioning and allocatin...
186
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We present a novel approach to embedding data represented by a network into a lowdimensional Euclidean space. Unlike existing methods, the proposed method attempts to minimize an ...
182
click to vote
AAAI
2006
15 years 8 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
169
click to vote
WILF
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we propose the Possibilistic C-Means in Feature Space and the One-Cluster Possibilistic C-Means in Feature Space algorithms which are kernel methods for clustering in...