Sciweavers

344 search results - page 31 / 69
» Streaming Algorithms for extent problems in high dimensions
Sort
View
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 2 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
13 years 3 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
123
Voted
ATAL
2008
Springer
15 years 3 months ago
Shared focus of attention for heterogeneous agents
A network of cooperating agents must be able to reach rough consensus on a set of topics for cooperation. With highly heterogeneous agents, however, incommensurable measures and i...
Jacob Beal
PODS
2001
ACM
190views Database» more  PODS 2001»
16 years 1 months ago
On the Effects of Dimensionality Reduction on High Dimensional Similarity Search
The dimensionality curse has profound e ects on the effectiveness of high-dimensional similarity indexing from the performance perspective. One of the well known techniques for im...
Charu C. Aggarwal
EDBT
2000
ACM
15 years 5 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel