684 search results - page 98 / 137 » On embedding well-separable graphs |
101
click to vote
BMCBI
2011
14 years 1 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...
207
click to vote
COMPGEOM
2011
ACM
14 years 1 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...
178
click to vote
SIGECOM
2011
ACM
14 years 17 days 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...
COMPGEOM
2004
ACM
15 years 3 months 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...
ECCV
2006
Springer
15 years 11 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...