Sciweavers

7055 search results - page 59 / 1411
» Some New 4-Designs
Sort
View
DAM
2006
63views more  DAM 2006»
14 years 12 months ago
A new family of proximity graphs: Class cover catch digraphs
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
Jason DeVinney, Carey E. Priebe
CSDA
2007
98views more  CSDA 2007»
14 years 12 months ago
A new Bayes estimate of the change point in the hazard function
An efficient estimate for the change point in the hazard function is obtained. This is based on a Bayesian estimator which uses equations concerning the parameters of a recently ...
Durdu Sertkaya Karasoy, Cem Kadilar
NC
2011
236views Neural Networks» more  NC 2011»
14 years 2 months ago
Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
Hans-Jörg Kreowski, Sabine Kuske
NOMS
2006
IEEE
105views Communications» more  NOMS 2006»
15 years 5 months ago
Adaptive Flow Aggregation - A New Solution for Robust Flow Monitoring under Security Attacks
— Flow-level traffic measurement is required for a wide range of applications including accounting, network planning and security management. A key design challenge is how to gr...
Yan Hu, Dah-Ming Chiu, John C. S. Lui
ECCC
2008
168views more  ECCC 2008»
14 years 12 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson