Sciweavers

603 search results - page 83 / 121
» Word or Phrase
Sort
View
IJCAI
2007
13 years 9 months ago
Identifying Expressions of Opinion in Context
While traditional information extraction systems have been built to answer questions about facts, subjective information extraction systems will answer questions about feelings an...
Eric Breck, Yejin Choi, Claire Cardie
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 9 months ago
Semantic Smoothing for Bayesian Text Classification with Small Training Data
Bayesian text classifiers face a common issue which is referred to as data sparsity problem, especially when the size of training data is very small. The frequently used Laplacian...
Xiaohua Zhou, Xiaodan Zhang, Xiaohua Hu
DAGSTUHL
2004
13 years 9 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
DAGSTUHL
2003
13 years 9 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 9 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau