13621 search results - page 195 / 2725 » Computability and Complexity in Self-assembly |
171
click to vote
ACTA
2007
15 years 6 months ago
2007
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
169
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
143
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
202
click to vote
DCG
2011
15 years 1 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
344
click to vote
NA
2011
15 years 1 months ago
2011
We propose a preconditioned variant of the modified HSS (MHSS) iteration method for solving a class of complex symmetric systems of linear equations. Under suitable conditions, w...