Sciweavers

376 search results - page 25 / 76
» Completely connected clustered graphs
Sort
View
LAWEB
2006
IEEE
14 years 1 months ago
Where and How Duplicates Occur in the Web
In this paper we study duplicates on the Web, using collections containing documents of all sites under the .cl domain that represent accurate and representative subsets of the We...
Álvaro R. Pereira Jr., Ricardo A. Baeza-Yat...
COMBINATORICS
2000
73views more  COMBINATORICS 2000»
13 years 7 months ago
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings
A counterexample is presented to Gy. Elekes's conjecture concerning the existence of long 2-colored paths in properly colored graphs. A modified version of the conjecture is ...
Vera Rosta
CLOUD
2010
ACM
14 years 23 days ago
Hermes: clustering users in large-scale e-mail services
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
Thomas Karagiannis, Christos Gkantsidis, Dushyanth...
ICML
2006
IEEE
14 years 8 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
TVCG
2008
121views more  TVCG 2008»
13 years 7 months ago
On the Visualization of Social and other Scale-Free Networks
This paper proposes novel methods for visualizing specifically the large power-law graphs that arise in sociology and the sciences. In such cases a large portion of edges can be sh...
Yuntao Jia, Jared Hoberock, Michael Garland, John ...