Sciweavers

1211 search results - page 18 / 243
» Topics in 0--1 data
Sort
View
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 7 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
EWSN
2004
Springer
14 years 7 months ago
Design of Surveillance Sensor Grids with a Lifetime Constraint
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
Vivek Mhatre, Catherine Rosenberg, Daniel Kofman, ...
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Named entity mining from click-through data using weakly supervised latent dirichlet allocation
This paper addresses Named Entity Mining (NEM), in which we mine knowledge about named entities such as movies, games, and books from a huge amount of data. NEM is potentially use...
Gu Xu, Shuang-Hong Yang, Hang Li
FOCS
2008
IEEE
14 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICDM
2010
IEEE
125views Data Mining» more  ICDM 2010»
13 years 5 months ago
Topic Modeling Ensembles
: Topic Modeling Ensembles Zhiyong Shen, Ping Luo, Shengwen Yang, Xukun Shen HP Laboratories HPL-2010-158 Topic model, Ensemble In this paper we propose a framework of topic model...
Zhiyong Shen, Ping Luo, Shengwen Yang, Xukun Shen