7015 search results - page 1380 / 1403 » Approximation algorithms for co-clustering |
KDD
2000
ACM
14 years 17 days ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
PPSN
2000
Springer
14 years 17 days ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
VVS
1995
IEEE
14 years 15 days ago
1995
IEEE
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
USENIX
2007
13 years 11 months ago
2007
Users are storing ever-increasing amounts of information digitally, driven by many factors including government regulations and the public’s desire to digitally record their per...
ISSTA
2010
ACM
13 years 11 months ago
2010
ACM
Writing reliable software is difficult. It becomes even more difficult when writing scientific software involving floating-point numbers. Computers provide numbers with limite...