684 search results - page 98 / 137 » On embedding well-separable graphs |
207
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
357
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
303
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...
168
click to vote
COMPGEOM
2004
ACM
16 years 1 days ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
179
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...