4131 search results - page 15 / 827 » Compactness in Topology and Computation |
ORDER
2002
15 years 1 months ago
2002
Let R be a quasi-order on a compact Hausdorff topological space X. We prove that if X is scattered, then R satisfies the Priestley separation axiom if and only if R is closed in th...
158
Voted
CVPR
2012
IEEE
13 years 4 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
100
click to vote
ICN
2007
Springer
15 years 8 months ago
2007
Springer
We develop algorithms for the compact representation of the trie structures that are used for Internet packet forwarding. Our compact representations are experimentally compared w...
182
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
We introduce the notion of a data topology and the problem of topology search over databases. A data topology summarizes the set of all possible relationships that connect a given...
96
Voted
RECOMB
2008
Springer
16 years 2 months ago
2008
Springer