9209 search results - page 133 / 1842 » Data Space Randomization |
126
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
141
click to vote
CIDM
2007
IEEE
15 years 11 months ago
2007
IEEE
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
152
click to vote
IROS
2007
IEEE
15 years 11 months ago
2007
IEEE
— We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained m...
128
click to vote
JC
2008
15 years 4 months ago
2008
We study the complexity of randomized solution of initial value problems for systems of ordinary differential equations (ODE). The input data are assumed to be -smooth ( = r+ : th...
172
click to vote
GLVLSI
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized systems. Since the design space is multi-objective, our aim ...