Sciweavers

757 search results - page 123 / 152
» Topical query decomposition
Sort
View
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
15 years 3 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
175
Voted
TCS
2011
14 years 11 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
SIGKDD
2010
146views more  SIGKDD 2010»
14 years 10 months ago
Latent semantic indexing (LSI) fails for TREC collections
The aim of latent semantic indexing (LSI) is to uncover the relationships between terms, hidden concepts, and documents. LSI uses the matrix factorization technique known as singu...
Avinash Atreya, Charles Elkan
CORR
2007
Springer
126views Education» more  CORR 2007»
15 years 4 months ago
Rethinking Information Theory for Mobile Ad Hoc Networks
The subject of this article is the long standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundam...
Jeffrey G. Andrews, Nihar Jindal, Martin Haenggi, ...
WWW
2008
ACM
16 years 4 months ago
Using subspace analysis for event detection from web click-through data
Although most of existing research usually detects events by analyzing the content or structural information of Web documents, a recent direction is to study the usage data. In th...
Ling Chen 0002, Yiqun Hu, Wolfgang Nejdl