نتایج جستجو برای: guess factor
تعداد نتایج: 848724 فیلتر نتایج به سال:
Cost-sensitive multiclass classification has recently acquired significance in several applications, through the introduction of multiclass datasets with well-defined misclassification costs. The design of classification algorithms for this setting is considered. It is argued that the unreliable performance of current algorithms is due to the inability of the underlying loss functions to enforc...
Abstract We sketch a relation between two crucial, yet independent, fields in quantum information research, viz. decoherence and cryptography. investigate here how the standard cryptographic assumption of shielded laboratory, stating that data generated by secure device remain private unless explicitly published, is disturbed einselection mechanism Darwinism explaining measurement process inter...
• INDEPENDENT -SET = {[G, k] : G is an undirected graph with an independent set of vertices I ⊆ V (G) of size ≥ k} where a subset I is independent iff it contains no edges of G. – Guess a set I of size k. Verify that it contains no edges of G. • CLIQUE = {[G, k] : G is an undirected graph with an independent set of vertices C ⊆ V (G) of size ≥ k} where a subset C is a clique iff every edge on t...
[1] This paper presents indirect observational evidence that desert dust can modulate the amplitude of easterly waves in the Atlantic Ocean. Twenty two years of NCEP/ NCAR reanalysis and dust from a global transport model are used to characterize the evolution of enhanced easterly waves. Lag composites of analysis increments (analysis minus first–guess) of geopotential height (700–hPa) anomalie...
We consider the problem of constructing codes that can correct δ deletions occurring in an arbitrary binary string of length n bits. Varshamov-Tenengolts (VT) codes can correct all possible single deletions (δ = 1) with an asymptotically optimal redundancy. Finding similar codes for δ ≥ 2 deletions is an open problem. We propose a new family of codes, that we call Guess & Check (GC) codes, that...
One-way cellular automata with restricted nondeterminism are investigated. The number of allowed nondeterministic state transitions is limited to a constant. It is shown that a limit to exactly one step does not decrease the language accepting capabilities. We prove a speed-up result that allows any linear-time computation to be sped-up to real-time. Some relationships to deterministic arrays a...
OBJECTIVE The aim of this study was to systematically review and evaluate the quality of current evidence about fluid therapy (FT) in acute pancreatitis (AP). BACKGROUND Intravenous FT is thought to be important in the early management of patients with AP. Clinically relevant questions remain regarding the type of fluid, the rate of administration, and the goal of FT. METHODS A comprehensiv...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید