17760 search results - page 248 / 3552 » A Generalization of the Massey-Ding Algorithm |
104
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper investigates the communication system of honeybees with the purpose of obtaining an intelligent approach for threedimensional reconstruction. A new framework i...
137
click to vote
COCOA
2008
Springer
15 years 6 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
128
click to vote
IMAMS
2007
15 years 6 months ago
2007
In this paper a method is presented to fair the limit surface of a subdivision algorithm around an extraordinary point. The eigenvalues and eigenvectors of the subdivision matrix d...
139
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
130
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...