20066 search results - page 364 / 4014 » T Spaces |
183
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
174
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
We describe a novel multiplexing approach to achieve tradeoffs in space, angle and time resolution in photography. We explore the problem of mapping useful subsets of time-varying...
189
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [2],[19]. We give restricted spa...
209
Voted
DASFAA
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. In many application domains, e.g. sensor databases, traffic management or recognition systems, objects have to be compared based on positionally and existentially uncert...
165
click to vote
PAKDD
2009
ACM
16 years 1 months ago
2009
ACM
Abstract. Clustering high dimensional data with sparse features is challenging because pairwise distances between data items are not informative in high dimensional space. To addre...