Sciweavers

4526 search results - page 527 / 906
» Algorithmic problems related to the Internet
Sort
View
ICASSP
2008
IEEE
16 years 1 months ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
16 years 1 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye
GECCO
2007
Springer
175views Optimization» more  GECCO 2007»
16 years 1 months ago
An evolutionary multiobjective approach to design highly non-linear Boolean functions
The proliferation of all kinds of devices with different security requirements and constraints, and the arms-race nature of the security problem are increasingly demanding the de...
Hernán E. Aguirre, Hiroyuki Okazaki, Yasush...
FOCS
2006
IEEE
16 years 27 days ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
WECWIS
2006
IEEE
78views ECommerce» more  WECWIS 2006»
16 years 25 days ago
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...