Sciweavers

2526 search results - page 219 / 506
» A New Algorithm for Answer Set Computation
Sort
View
ICALP
2004
Springer
15 years 12 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
16 years 21 days ago
Heuristic speciation for evolving neural network ensemble
Speciation is an important concept in evolutionary computation. It refers to an enhancements of evolutionary algorithms to generate a set of diverse solutions. The concept is stud...
Shin Ando
TIP
1998
129views more  TIP 1998»
15 years 6 months ago
Minimax partial distortion competitive learning for optimal codebook design
— The design of the optimal codebook for a given codebook size and input source is a challenging puzzle that remains to be solved. The key problem in optimal codebook design is h...
Ce Zhu, Lai-Man Po
SI3D
1992
ACM
15 years 10 months ago
Interactive Volume Rendering on a Multicomputer
Direct volume rendering is a computationally intensive operation that has become a valued and often preferred visualization tool. For maximal data comprehension, interactive manip...
Ulrich Neumann
CVPR
2001
IEEE
16 years 8 months ago
Semi-Dense Stereo Correspondence with Dense Features
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
Olga Veksler