497 search results - page 30 / 100 » A Really Good Idea |
KDD
2001
ACM
14 years 10 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
DCC
2006
IEEE
14 years 9 months ago
2006
IEEE
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
EVOW
2009
Springer
14 years 4 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
IWSOS
2009
Springer
14 years 4 months ago
2009
Springer
Internet Coordinate Systems (ICS) provide easy and practical latency predictions in the Internet. However, peer dynamics (i.e, churn), which is an inherent property of peer-to-peer...
FGCN
2008
IEEE
14 years 4 months ago
2008
IEEE
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...