Sciweavers

2031 search results - page 218 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
GECCO
2010
Springer
155views Optimization» more  GECCO 2010»
15 years 3 months ago
Negative selection algorithms without generating detectors
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
Maciej Liskiewicz, Johannes Textor
80
Voted
FOCS
2008
IEEE
15 years 5 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
118
Voted
ICCV
2009
IEEE
16 years 3 months ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
114
Voted
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 5 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
MIDDLEWARE
2007
Springer
15 years 5 months ago
A Policy Management Framework for Content-Based Publish/Subscribe Middleware
Abstract. Content-based Publish/Subscribe (CPS) is a powerful paradigm providing loosely-coupled, event-driven messaging services. Although the general CPS model is well-known, man...
Alex Wun, Hans-Arno Jacobsen