نتایج جستجو برای: inexpensive
تعداد نتایج: 22131 فیلتر نتایج به سال:
Suppose that independent U 0 1 weights are assigned to the (d2)n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expected weight of the minimum-weight perfect d-dimensional matching is at least 3 16n 1− 2/d . We describe a randomized algorithm that finds a perfect d-dimensional matching whose expected weight is at most 5d3n1− 2/d + d1...
This proposed design for a mini thermonuclear reactor uses a method based upon a series of important innovations. A cumulative explosion presses a capsule with nuclear fuel up to 100 thousands of atmospheres, the explosive electric generator heats the capsule/pellet up to 100 million degrees and a special capsule and a special cover which keeps these pressure and temperature in capsule up to 0....
Computational Private Information Retrieval(cPIR) schemes allow a user to retrieve data from a database privately while exchanging only a small amount of data between the database and the user, where the privacy is based on a cryptographic assumption. All previous cPIR protocols require the database to compute a modular multiplication for every bit of the database on each query, making them too...
For adults, immersive environments for collaboration and play are expensive computer-intensive novelties. For children, they are commonplace but computer-free: kindergarten classrooms and playgrounds. Kids know how to develop, and spontaneously learn from imaginary play. If children were provided with robust, intuitive, and inexpensive computer-enabled environments they would thrive, learn, and...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید