1814 search results - page 55 / 363 » Improved Results on Geometric Hitting Set Problems |
173
click to vote
BILDMED
2004
15 years 7 months ago
2004
In this paper we present a level-set framework for accurate and efficient extraction of the surface of a brain from MRI data. To prevent the so-called partial volume effect we use ...
143
click to vote
CCCG
2008
15 years 7 months ago
2008
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
171
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
143
click to vote
ACSAC
2001
IEEE
15 years 9 months ago
2001
IEEE
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
155
click to vote
FC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. This paper introduces certified sets to the private set intersection problem. A private set intersection protocol allows Alice and Bob to jointly compute the set intersec...