نتایج جستجو برای: barak valley
تعداد نتایج: 27326 فیلتر نتایج به سال:
11 species of fishes belonging to 8 genera, 4 families and 3 Orders have been recorded. The cyprinids were the most abundant group. contribution total fish collection depicts its highest (96.87 %) in river Barak at Karong. Among cyprinids, Barilius bendelisis Crossocheilus burmanicus depicted bulk abundance (19.35 33.87 % respectively)
Morphotectonic is one of the new reconition methods of tectonic movements and earthquakes knowledge. Study and measurement of landscapes and forms which made by active tectonics are important objects in morphology science. Active tectonic movements have recorded in the morphology of rivers, drainages, alluvial fans and mountain fronts in a region. Research area is located between 55° 30' -57° 0...
The celebrated work of Barak et al. (Crypto’01) ruled out the possibility of virtual blackbox (VBB) obfuscation for general circuits. The recent work of Canetti, Kalai, and Paneth (TCC’15) extended this impossibility to the random oracle model as well assuming the existence of trapdoor permutations (TDPs). On the other hand, the works of Barak et al. (Crypto’14) and Brakerski-Rothblum (TCC’14) ...
A question raised by the recent subexponential algorithm for Unique Games (Arora, Barak, Steurer, FOCS 2010) is what other “hard-looking” problems admit good approximation algorithms with subexponential complexity. In this work, we give such an algorithm for d-to-1 two-prover games, a broad class of constraint satisfaction problems. Our algorithm has several consequences for Khot’s d-to-1 Conje...
The morphology of glacial valley can be described in terms of power law or quadratic equations fitted to valley cross-profiles. These two models are used to study the cross-profiles of 86 valley cross-profiles in the Zardkuh Mountain in order to understand the evolutional patterns of valleys. Assessment of using the power law function indicates that b values for both valley sides range from 1.0...
Today we’ll cover some recent results from the paper Lower bounds on information complexity via zero-communication bounds and applications by Kerenidis, Laplante, Lerays, Roland, and Xiao (FOCS 2012). We’ll also recall results covered in past lectures from the papers The partition bound for classical communication complexity and query complexity by Jain and Klauck (CCC 2010) and How to compress...
This Article is brought to you for free and open access by the Ocean, Earth & Atmospheric Sciences at ODU Digital Commons. It has been accepted for inclusion in OEAS Faculty Publications by an authorized administrator of ODU Digital Commons. For more information, please contact [email protected]. Repository Citation Rahav, Eyal; Herut, Barak; Stambler, Noga; Bar-Zeev, Edo; and Mulholland, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید