Sciweavers

680 search results - page 102 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
SIGECOM
2008
ACM
122views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
On the windfall of friendship: inoculation strategies on social networks
This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit i...
Dominic Meier, Yvonne Anne Oswald, Stefan Schmid, ...
ICPR
2010
IEEE
13 years 6 months ago
One-Lead ECG-based Personal Identification Using Ziv-Merhav Cross Parsing
The advance of falsification technology increases security concerns and gives biometrics an important role in security solutions. The electrocardiogram (ECG) is an emerging biometr...
David Pereira Coutinho, Ana L. N. Fred, Már...
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
14 years 25 days ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
SPATIALCOGNITION
2000
Springer
13 years 11 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
14 years 2 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma