449 search results - page 45 / 90 » What is Initiative |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
CHI
2009
ACM
14 years 8 months ago
2009
ACM
Hannamari Saarenp?? University of Tampere Kanslerinrinne 1 33014 Tampereen Yliopisto, Finland hannamari.saarenpaa@uta.fi Hannu Korhonen Nokia Research P.O. Box 1000 00045 Nokia Gro...
SIGCSE
2009
ACM
14 years 8 months ago
2009
ACM
It is difficult for instructors of CS1 and CS2 courses to get accurate answers to such critical questions as "how long are students spending on programming assignments?"...
CHI
2007
ACM
14 years 8 months ago
2007
ACM
As computing expands its domain from workplace to pervasive and domestic environments, interest in aesthetics for designing is increasing in HCI. HCI literatures in aesthetics pro...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...