Sciweavers

177 search results - page 15 / 36
» Distributed Discovery of Large Near-Cliques
Sort
View
KDD
2004
ACM
210views Data Mining» more  KDD 2004»
14 years 7 months ago
Probabilistic author-topic models for information discovery
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
Mark Steyvers, Padhraic Smyth, Michal Rosen-Zvi, T...
HIPC
1999
Springer
13 years 11 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
ICDCS
2009
IEEE
14 years 4 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
14 years 8 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
IJACTAICIT
2010
120views more  IJACTAICIT 2010»
13 years 4 months ago
Representing Image Search Performance Using Time Series Models
Image search engines tend to return a large number of images which the engines consider to be relevant, and such pool of results generally is very large and may be regarded to be ...
Xiaoling Wang, Clement. H. C. Leung