Sciweavers

7648 search results - page 1375 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
159
Voted
CGF
2011
14 years 6 months ago
SQuad: Compact Representation for Triangle Meshes
The SQuad data structure represents the connectivity of a triangle mesh by its “S table” of about 2 rpt (integer references per triangle). Yet it allows for a simple implement...
Topraj Gurung, Daniel E. Laney, Peter Lindstrom, J...
147
Voted
JACM
2011
152views more  JACM 2011»
14 years 5 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...
145
Voted
WSDM
2012
ACM
236views Data Mining» more  WSDM 2012»
13 years 10 months ago
Effective query formulation with multiple information sources
Most standard information retrieval models use a single source of information (e.g., the retrieval corpus) for query formulation tasks such as term and phrase weighting and query ...
Michael Bendersky, Donald Metzler, W. Bruce Croft
151
Voted
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
13 years 5 months ago
Web image prediction using multivariate point processes
In this paper, we investigate a problem of predicting what images are likely to appear on the Web at a future time point, given a query word and a database of historical image str...
Gunhee Kim, Fei-Fei Li, Eric P. Xing
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 3 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
« Prev « First page 1375 / 1530 Last » Next »