2969 search results - page 458 / 594 » A space efficient algorithm for group structure computation |
155
Voted
DEBS
2008
ACM
15 years 8 months ago
2008
ACM
We consider a distributed system that disseminates highvolume event streams to many simultaneous monitoring applications over a low-bandwidth network. For bandwidth efficiency, we...
150
click to vote
JCSS
2007
15 years 6 months ago
2007
The financial services industry today produces and consumes huge amounts of data and the processes involved in analysing these data are equally huge especially in terms of their c...
178
click to vote
CGF
2010
15 years 6 months ago
2010
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
175
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This work addresses selected aspects of natural evolution, especially of the field of population genetics, that are considered to be meaningful for algorithmic further development...
162
click to vote
JACM
1998
15 years 6 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...