1920 search results - page 49 / 384 » The Complexity of the A B C Problem |
154
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
181
click to vote
SSDBM
2007
IEEE
16 years 7 days ago
2007
IEEE
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
140
click to vote
CAV
2009
Springer
16 years 6 months ago
2009
Springer
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
197
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Physical maps are the substrate of genome sequencing and map-based cloning and their construction relies on the accurate assembly of BAC clones into large contigs that...
142
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...