42230 search results - page 138 / 8446 » Algorithms and Complexity Results for |
CORR
2002
Springer
14 years 9 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
IJIS
2007
14 years 10 months ago
2007
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
DIS
2006
Springer
15 years 1 months ago
2006
Springer
We propose a novel method, called heterogeneous clustering ensemble (HCE), to generate robust clustering results that combine multiple partitions (clusters) derived from various cl...
101
click to vote
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
103
click to vote
MSO
2003
14 years 11 months ago
2003
The use of sub-optimal digital systems can at times lead to high speed, efficient, costeffective structures that are sufficient to perform needed tasks. We describe here a system ...