Sciweavers

492 search results - page 8 / 99
» The number of possibilities for random dating
Sort
View
DATE
2000
IEEE
101views Hardware» more  DATE 2000»
13 years 12 months ago
Memory Arbitration and Cache Management in Stream-Based Systems
With the ongoing advancements in VLSI technology, the performance of an embedded system is determined to a large extend by the communication of data and instructions. This results...
Françoise Harmsze, Adwin H. Timmer, Jef L. ...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 8 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
ECMDAFA
2009
Springer
109views Hardware» more  ECMDAFA 2009»
14 years 2 months ago
Uniform Random Generation of Huge Metamodel Instances
The size and the number of models is drastically increasing, preventing organizations from fully exploiting Model Driven Engineering benefits. Regarding this problem of scalabilit...
Alix Mougenot, Alexis Darrasse, Xavier Blanc, Mich...
BMCBI
2008
169views more  BMCBI 2008»
13 years 7 months ago
A comprehensive comparison of random forests and support vector machines for microarray-based cancer classification
Background: Cancer diagnosis and clinical outcome prediction are among the most important emerging applications of gene expression microarray technology with several molecular sig...
Alexander R. Statnikov, Lily Wang, Constantin F. A...
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan