401 search results - page 53 / 81 » Algorithms for a Simple Point Placement Problem |
112
click to vote
ADHOC
2006
14 years 12 months ago
2006
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
ECCC
2007
14 years 11 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
SIROCCO
2008
15 years 1 months ago
2008
Abstract. We consider a fixed, undirected, known network and a number of "mobile agents" which can traverse the network in synchronized steps. Some nodes in the network m...
ICRA
2003
IEEE
15 years 5 months ago
2003
IEEE
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...