900 search results - page 55 / 180 » On Polynomial Time Computation over Unordered Structures |
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
Characterizing setup/hold times of latches and registers, a crucial component for achieving timing closure of large digital designs, typically occupies months of computation in in...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
WABI
2005
Springer
14 years 2 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...