Sciweavers

2370 search results - page 35 / 474
» A Structured Set of Higher-Order Problems
Sort
View
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
14 years 6 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
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...
Hiroki Arimura, Takeaki Uno
STACS
2001
Springer
14 years 1 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
CVPR
2006
IEEE
14 years 11 months ago
Extracting Subimages of an Unknown Category from a Set of Images
Suppose a set of images contains frequent occurrences of objects from an unknown category. This paper is aimed at simultaneously solving the following related problems: (1) unsupe...
Sinisa Todorovic, Narendra Ahuja
STACS
1997
Springer
14 years 1 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal
TCS
2010
13 years 7 months ago
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
Chaim Goodman-Strauss