Sciweavers

1434 search results - page 96 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
KDD
2003
ACM
205views Data Mining» more  KDD 2003»
14 years 10 months ago
The data mining approach to automated software testing
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
Mark Last, Menahem Friedman, Abraham Kandel
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 4 months ago
The total path length of split trees
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
Nicolas Broutin, Cecilia Holmgren
CCGRID
2003
IEEE
14 years 3 months ago
Supporting Peer-to-Peer Computing with FlexiNet
Formation of suitable overlay-network topologies that are able to reflect the structure of the underlying network-infrastructure, has rarely been addressed by peer-to-peer applic...
Thomas Fuhrmann
LSGRID
2004
Springer
14 years 3 months ago
Distributed Cell Biology Simulations with E-Cell System
Many useful applications of simulation in computational cell biology, e.g. kinetic parameter estimation, Metabolic Control Analysis (MCA), and bifurcation analysis, require a large...
Masahiro Sugimoto, Kouichi Takahashi, Tomoya Kitay...
EUROCRYPT
2005
Springer
14 years 3 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...