Sciweavers

1814 search results - page 55 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
BILDMED
2004
204views Algorithms» more  BILDMED 2004»
13 years 10 months ago
Topologically Correct Extraction of the Cortical Surface of a Brain Using Level-Set Methods
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 ...
Stephan Bischoff, Leif Kobbelt
CCCG
2008
13 years 10 months ago
Core-Preserving Algorithms
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 ...
Hamid Zarrabi-Zadeh
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 6 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu
ACSAC
2001
IEEE
14 years 21 days ago
Mining Alarm Clusters to Improve Alarm Handling Efficiency
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...
Klaus Julisch
FC
2009
Springer
84views Cryptology» more  FC 2009»
14 years 28 days ago
Private Intersection of Certified Sets
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...
Jan Camenisch, Gregory M. Zaverucha