Sciweavers

311 search results - page 57 / 63
» Better streaming algorithms for clustering problems
Sort
View
ICDE
2009
IEEE
136views Database» more  ICDE 2009»
14 years 9 months ago
A Concise Representation of Range Queries
Abstract--With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
EMNLP
2009
13 years 5 months ago
The infinite HMM for unsupervised PoS tagging
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
Jurgen Van Gael, Andreas Vlachos, Zoubin Ghahraman...
VDA
2010
169views Visualization» more  VDA 2010»
13 years 10 months ago
Techniques for precision-based visual analysis of projected data
The analysis of high-dimensional data is an important, yet inherently difficult problem. Projection techniques such as PCA, MDS, and SOM can be used to map high-dimensional data t...
Tobias Schreck, Tatiana von Landesberger, Sebastia...
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
12 years 10 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ï¬...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
CIKM
2007
Springer
14 years 1 months ago
Finding and linking incidents in news
News reports are being produced and disseminated in overwhelming volume, making it difficult to keep up with the newest information. Most previous research in automatic news organ...
Ao Feng, James Allan