Sciweavers

4377 search results - page 49 / 876
» Mass problems and randomness
Sort
View
WSC
1998
14 years 11 months ago
Input Modeling Tools for Complex Problems
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
Barry L. Nelson, Michael Yamnitsky
CORR
2004
Springer
83views Education» more  CORR 2004»
14 years 9 months ago
A proof of Alon's second eigenvalue conjecture and related problems
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
Joel Friedman
ISPEC
2009
Springer
15 years 4 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
CORR
2008
Springer
152views Education» more  CORR 2008»
14 years 10 months ago
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and
Pinyan Lu, Changyuan Yu
BMCBI
2007
166views more  BMCBI 2007»
14 years 10 months ago
Optimization of filtering criterion for SEQUEST database searching to improve proteome coverage in shotgun proteomics
Background: In proteomic analysis, MS/MS spectra acquired by mass spectrometer are assigned to peptides by database searching algorithms such as SEQUEST. The assignations of pepti...
Xinning Jiang, Xiaogang Jiang, Guanghui Han, Mingl...