Sciweavers

236 search results - page 39 / 48
» Binary Partitions Revisited
Sort
View
ICFCA
2009
Springer
14 years 15 hour ago
Handling Large Formal Context Using BDD - Perspectives and Limitations
This paper presents Binary Decision Diagrams (BDDs) applied to Formal Concept Analysis (FCA). The aim is to increase the FCA capability to handle large formal contexts. The main id...
Andrei Rimsa, Luis E. Zárate, Mark A. J. So...
GD
1998
Springer
13 years 11 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
BMVC
2001
13 years 9 months ago
Spectral and Spatial Invariant Image Retrieval using Scene Structural Matrix
We introduce Scene Structural Matrix (SSM), a novel image content descriptor and its application to invariant image retrieval. The SSM captures the overall structural characterist...
Guoping Qiu, S. Sudirman
ARC
2008
Springer
126views Hardware» more  ARC 2008»
13 years 9 months ago
DNA Physical Mapping on a Reconfigurable Platform
Reconfigurable architectures enable the hardware function to be implemented by the user and, due to its characteristics, have been used in many areas, including Bioinformatics. One...
Adriano Idalgo, Nahri Moreano