804 search results - page 8 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
TCAD
1998
13 years 7 months ago
1998
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
DMIN
2007
13 years 9 months ago
2007
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
PUC
2002
13 years 7 months ago
2002
Computer science algorithms can be used to improve user interfaces. Using data structures as a source of design ideas, a new interface was constructed for a cellular telephone han...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...