401 search results - page 35 / 81 » Algorithms for a Simple Point Placement Problem |
125
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
112
click to vote
DCG
2008
15 years 2 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
TON
2002
15 years 1 months ago
2002
Abstract-Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the Shortest Paths Problem. The Border Gateway Protocol (BGP) is cu...
120
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
In this paper we consider the problem of segmenting multiple rigid motions using multi?frame point correspondence data. The main idea of the method is to group points according to...
119
click to vote
COLT
2003
Springer
15 years 7 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...