Sciweavers

1538 search results - page 46 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
ICML
2005
IEEE
14 years 11 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic
EMNLP
2006
13 years 11 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
ARTCOM
2009
IEEE
13 years 8 months ago
Adaptive Encoding Algorithm for Multispectral Images
A new adaptive multispectral image compression technique based on the regions identified is proposed. The algorithm is adaptive in the sense that according to the data type class ...
Deepa Sankarapandi
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
On weakly optimal partitions in modular networks
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
José Ignacio Alvarez-Hamelin, Beiró ...
GD
2008
Springer
13 years 11 months ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
Tim Dwyer, Kim Marriott, Michael Wybrow