51 search results - page 6 / 11 » How slow is the k-means method |
145
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
108
Voted
PG
2003
IEEE
15 years 6 months ago
2003
IEEE
A texture atlas is an efficient way to represent information (like colors, normals, displacement maps ...) on triangulated surfaces. The LSCM method (Least Squares Conformal Maps...
75
Voted
APCCM
2007
15 years 2 months ago
2007
Integration of XML data is an increasingly important problem and many methods have recently been developed. In this talk, we examine the related and more challenging task of how t...
125
click to vote
CASCON
2008
15 years 2 months ago
2008
Today's database management systems (DBMSs) are required to handle diverse, mixed workloads and to provide differentiated levels of service to ensure that critical work takes...
81
Voted
FOCM
2010
14 years 11 months ago
2010
We show how B-series may be used to derive in a systematic way the analytical expressions of the high-order stroboscopic averaged equations that approximate the slow dynamics of h...