Sciweavers

183 search results - page 3 / 37
» Complete Minors and Independence Number
Sort
View
JGT
2006
98views more  JGT 2006»
14 years 11 months ago
Group chromatic number of planar graphs of girth at least 4
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
Hong-Jian Lai, Xiangwen Li
ESSOS
2009
Springer
15 years 6 months ago
Report: Extensibility and Implementation Independence of the .NET Cryptographic API
Abstract. When a vulnerability is discovered in a cryptographic algorithm, or in a specific implementation of that algorithm, it is important that software using that algorithm or...
Pieter Philippaerts, Cédric Boon, Frank Pie...
BMCBI
2007
120views more  BMCBI 2007»
14 years 11 months ago
Re-sampling strategy to improve the estimation of number of null hypotheses in FDR control under strong correlation structures
Background: When conducting multiple hypothesis tests, it is important to control the number of false positives, or the False Discovery Rate (FDR). However, there is a tradeoff be...
Xin Lu, David L. Perkins
FOCS
2009
IEEE
15 years 6 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
MSS
2010
IEEE
133views Hardware» more  MSS 2010»
14 years 10 months ago
A trichotomy of attitudes for decision-making under complete ignorance
This paper investigates ‘complete ignorance’ (CI) in the tradition of the CI literature and provides a characterization of possible attitudes toward ignorance. Pessimism, opti...
Ronan Congar, François Maniquet