4372 search results - page 788 / 875 » Algorithmic Theories of Everything |
168
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
169
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
171
click to vote
EMSOFT
2009
Springer
15 years 10 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
164
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...