Sciweavers

5356 search results - page 354 / 1072
» Adventures in time and space
Sort
View
ICDE
2010
IEEE
222views Database» more  ICDE 2010»
15 years 5 months ago
Finding Clusters in subspaces of very large, multi-dimensional datasets
Abstract— We propose the Multi-resolution Correlation Cluster detection (MrCC), a novel, scalable method to detect correlation clusters able to analyze dimensional data in the ra...
Robson Leonardo Ferreira Cordeiro, Agma J. M. Trai...
DCC
2008
IEEE
16 years 6 months ago
Probabilistic algorithm for finding roots of linearized polynomials
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
Vitaly Skachek, Ron M. Roth
DCC
2008
IEEE
16 years 6 months ago
A Simple Algorithm for Computing the Lempel Ziv Factorization
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
Maxime Crochemore, Lucian Ilie, W. F. Smyth
ECIR
2009
Springer
16 years 4 months ago
Evaluation of Text Clustering Algorithms with N-Gram-Based Document Fingerprints
This paper presents a new approach designed to reduce the computational load of the existing clustering algorithms by trimming down the documents size using fingerprinting methods...
Javier Parapar, Alvaro Barreiro
COMPGEOM
2009
ACM
16 years 1 months ago
Shooting permanent rays among disjoint polygons in the plane
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
Mashhood Ishaque, Bettina Speckmann, Csaba D. T&oa...