Sciweavers

10289 search results - page 37 / 2058
» Standard bases in K
Sort
View
SBCCI
2005
ACM
86views VLSI» more  SBCCI 2005»
15 years 7 months ago
Ultra-low power CMOS cells for temperature sensors
Temperature sensors and voltage references require cells that generate both PTAT (Proportional To Absolute Temperature) and NTC (Negative Temperature Coefficient) voltages. We pre...
Conrado Rossi, Pablo Aguirre
SIGUCCS
2003
ACM
15 years 7 months ago
Deep in benchmarking: using industry standards to assess a training program
At the University of Missouri – Columbia’s Information and Access Technology (IAT) Services, InfoTech Training compares the results of their IT training program with similar t...
Joleen Pfefer
DNA
2000
Springer
148views Bioinformatics» more  DNA 2000»
15 years 5 months ago
A Space-Efficient Randomized DNA Algorithm for k-SAT
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
Kevin Chen, Vijay Ramachandran
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 8 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka
PEPM
1994
ACM
15 years 6 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder