315 search results - page 29 / 63 » Eigenvalue bounds for independent sets |
161
click to vote
ROBOCOMM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
177
click to vote
ICASSP
2010
IEEE
15 years 7 months ago
2010
IEEE
Given a set of data points drawn from multiple low-dimensional linear subspaces of a high-dimensional space, we consider the problem of clustering these points according to the su...
188
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
167
click to vote
ILP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
202
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...