Sciweavers

3040 search results - page 296 / 608
» Independent Natural Extension
Sort
View
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
ECOOP
2007
Springer
16 years 29 days ago
Morphing: Safely Shaping a Class in the Image of Others
We present MJ: a language for specifying general classes whose members are produced by iterating over members of other classes. We call this technique “class morphing” or just ...
Shan Shan Huang, David Zook, Yannis Smaragdakis
FSTTCS
2007
Springer
16 years 29 days ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
GFKL
2007
Springer
148views Data Mining» more  GFKL 2007»
16 years 29 days ago
Mixture Model Based Group Inference in Fused Genotype and Phenotype Data
The analysis of genetic diseases has classically been directed towards establishing direct links between cause, a genetic variation, and effect, the observable deviation of phenot...
Benjamin Georgi, M. Anne Spence, Pamela Flodman, A...
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
16 years 29 days ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...