opening it up with Common Lisp

Favorite weblogs

Lisp Related

Bill Clementson

Finding Lisp

Lemonodor

Lispmeister.com

Planet Lisp

Politics

Orcinus

Talking Points Memo

This Modern World

Working for Change

Other home

Polliblog

Recent Readings

Book review: Darwinia
Reviewed: Friday, August 11, 2006

Summer reading: Spin
Reviewed: Saturday, August 5, 2006

Runner
Reviewed: Tuesday, July 18, 2006

the Omnivoire's Delimma
Reviewed: Wednesday, July 12, 2006

the Golem's Eye
Reviewed: Wednesday, May 31, 2006





tinderbox

Incremental Clustering and Dynamic Information Retrieval
Moses Charikar and Chandra Chekuri and Tomas Feder and Rajeev Motwani, 0
Wednesday, May 19, 2004

This paper analyses one variant of the dynamic clustering problem: how to efficiently maintain a clustering of points (from a metric space) such that the diameter of the maximum cluster is minimized. Their work focuses particularly on the needs of Document indexing and retrieval (though it would easily generalize). They use Hierarchical Agglomerative Clustering (HAC) because the dendograms (trees) produced can be viewed as query refinements. The rest of the paper presents and analyses several dynamic algorithms and gives tight time and performance bounds for them. Interestingly, the authors show that it is possible to obtain results that are comparable to the best possible


Home | About | Quotes | Recent | Archives

Copyright -- Gary Warren King, 2004 - 2006