Sciweavers

5948 search results - page 826 / 1190
» Computing Robust Counter-Strategies
Sort
View
174
Voted
CCS
2010
ACM
15 years 6 months ago
Recruiting new tor relays with BRAIDS
Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a lar...
Rob Jansen, Nicholas Hopper, Yongdae Kim
SAC
2010
ACM
15 years 6 months ago
Visual processing-inspired fern-audio features for noise-robust speaker verification
In this paper, we consider the problem of speaker verification as a two-class object detection problem in computer vision, where the object instances are 1-D short-time spectral v...
Anindya Roy, Sébastien Marcel
AUTOMATICA
2007
70views more  AUTOMATICA 2007»
15 years 6 months ago
Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete...
A. Alessio, Mircea Lazar, Alberto Bemporad, W. P. ...
194
Voted
CGF
2010
146views more  CGF 2010»
15 years 6 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
168
Voted
CAD
2008
Springer
15 years 6 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene