Sciweavers

3708 search results - page 40 / 742
» Approximating Betweenness Centrality
Sort
View
CSDA
2008
128views more  CSDA 2008»
13 years 11 months ago
On the equivalence between Non-negative Matrix Factorization and Probabilistic Latent Semantic Indexing
Non-negative Matrix Factorization (NMF) and Probabilistic Latent Semantic Indexing (PLSI) have been successfully applied to document clustering recently. In this paper, we show th...
Chris H. Q. Ding, Tao Li, Wei Peng
COLING
2010
13 years 6 months ago
DL Meet FL: A Bidirectional Mapping between Ontologies and Linguistic Knowledge
We present a transformation scheme that mediates between description logics (DL) or RDF-encoded ontologies and type hierarchies in feature logics (FL). The DL-to-FL direction is i...
Hans-Ulrich Krieger, Ulrich Schäfer
CIKM
2006
Springer
14 years 2 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
DGO
2008
188views Education» more  DGO 2008»
14 years 12 days ago
Enabling synergy between psychology and natural language processing for e-Government: crime reporting and investigative intervie
We are developing an automated crime reporting and investigative interview system. The system incorporates cognitive interview techniques to maximize witness memory recall, and in...
Alicia Iriberri, Chih Hao Ku, Gondy Leroy
TIT
1998
69views more  TIT 1998»
13 years 10 months ago
Relationships Between the Constant Modulus and Wiener Receivers
— The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus...
Hanks H. Zeng, Lang Tong, C. Richard Johnson Jr.