7006 search results - page 629 / 1402 » Approximation Algorithms |
211
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
180
click to vote
ISCI
1998
15 years 7 months ago
1998
This paper presents a method for updating approximations of a concept incrementally. The results can be used to implement a quasi-incremental algorithm for learning classification...
195
click to vote
GD
2004
Springer
16 years 22 days ago
2004
Springer
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
208
click to vote
EMMCVPR
2005
Springer
16 years 27 days ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
226
Voted
AMAI
2004
Springer
16 years 23 days ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...