Sciweavers

1083 search results - page 9 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
TC
2010
13 years 6 months ago
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
—Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Prec...
Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel ...
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 8 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
VLDB
1998
ACM
312views Database» more  VLDB 1998»
13 years 11 months ago
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
Gholamhosein Sheikholeslami, Surojit Chatterjee, A...
3DIM
1999
IEEE
13 years 12 months ago
Multiview Registration for Large Data Sets
In this paper we present a multiview registration method for aligning range data. We first align scans pairwise with each other and use the pairwise alignments as constraints that...
Kari Pulli
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 9 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs