25041 search results - page 4555 / 5009 » Algorithms for Clustering Data |
189
click to vote
ISAAC
2005
Springer
16 years 10 days ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
187
Voted
IWQOS
2005
Springer
16 years 10 days ago
2005
Springer
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
220
click to vote
NLDB
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. A large amount of biological knowledge today is only available from full-text research papers. Since neither manual database curators nor users can keep up with the rapid...
173
click to vote
SAT
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
190
click to vote
SCALESPACE
2005
Springer
16 years 10 days ago
2005
Springer
The problem of image deblurring in the presence of salt and pepper noise is considered. Standard image deconvolution algorithms, that are designed for Gaussian noise, do not perfor...