Sciweavers

943 search results - page 150 / 189
» How should data structures and algorithms be taught
Sort
View
KDD
2007
ACM
167views Data Mining» more  KDD 2007»
14 years 8 months ago
Generalized component analysis for text with heterogeneous attributes
We present a class of richly structured, undirected hidden variable models suitable for simultaneously modeling text along with other attributes encoded in different modalities. O...
Xuerui Wang, Chris Pal, Andrew McCallum
ICDE
2012
IEEE
237views Database» more  ICDE 2012»
11 years 10 months ago
On Discovery of Traveling Companions from Streaming Trajectories
— The advance of object tracking technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data stream. In this study, we investigate the pro...
Lu An Tang, Yu Zheng, Jing Yuan, Jiawei Han, Alice...
EDBT
2012
ACM
257views Database» more  EDBT 2012»
11 years 10 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 6 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen