531 search results - page 38 / 107 » A Better Algorithm for Random k-SAT |
PAKDD
2007
ACM
14 years 2 months ago
2007
ACM
In this paper, we study the privacy-preserving decision tree building problem on vertically partitioned data. We made two contributions. First, we propose a novel hybrid approach, ...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
ACMSE
2005
ACM
14 years 1 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
EUROPAR
1997
Springer
14 years 17 hour ago
1997
Springer
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
IJON
2006
13 years 7 months ago
2006
In text management tasks, the dimensionality reduction becomes necessary to computation and interpretability of the results generated by machine learning algorithms. This paper de...