Sciweavers

1105 search results - page 88 / 221
» Approximate Spectral Clustering.
Sort
View
88
Voted
ICPR
2008
IEEE
15 years 7 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
99
Voted
EMNLP
2006
15 years 2 months ago
Lexicon Acquisition for Dialectal Arabic Using Transductive Learning
We investigate the problem of learning a part-of-speech (POS) lexicon for a resource-poor language, dialectal Arabic. Developing a high-quality lexicon is often the first step tow...
Kevin Duh, Katrin Kirchhoff
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
16 years 2 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
115
Voted
ICDCS
2006
IEEE
15 years 6 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CVPR
2008
IEEE
16 years 2 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán