291 search results - page 51 / 59 » Clustering and the Biclique Partition Problem |
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— People in densely populated environments typically form groups that split and merge. In this paper we track groups of people so as to reflect this formation process an...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
PC
2007
13 years 8 months ago
2007
Physically based simulation of cloth in virtual environments is a computationally demanding problem. It involves modeling the internal material properties of the textile (physical...
EUROSYS
2006
ACM
14 years 6 months ago
2006
ACM
The database tier of dynamic content servers at large Internet sites is typically hosted on centralized and expensive hardware. Recently, research prototypes have proposed using d...
CIKM
2004
Springer
14 years 2 months ago
2004
Springer
It is crucial in many information systems to organize short text segments, such as keywords in documents and queries from users, into a well-formed topic hierarchy. In this paper,...