Sciweavers

9716 search results - page 66 / 1944
» The Case for Energy-Proportional Computing
Sort
View
JAR
1998
134views more  JAR 1998»
14 years 9 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
TPDS
1998
92views more  TPDS 1998»
14 years 9 months ago
An Efficient Algorithm for Row Minima Computations on Basic Reconfigurable Meshes
—A matrix A of size m œ n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 ‹ i < j ‹ m, the minimum value in row j lies below or to...
Koji Nakano, Stephan Olariu
HCI
2009
14 years 7 months ago
Partially Observable Markov Decision Process (POMDP) Technologies for Sign Language Based Human-Computer Interaction
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...
Sylvie C. W. Ong, David Hsu, Wee Sun Lee, Hanna Ku...
BMCBI
2010
155views more  BMCBI 2010»
14 years 7 months ago
BrEPS: a flexible and automatic protocol to compute enzyme-specific sequence profiles for functional annotation
Background: Models for the simulation of metabolic networks require the accurate prediction of enzyme function. Based on a genomic sequence, enzymatic functions of gene products a...
Constantin Bannert, A. Welfle, C. aus dem Spring, ...
FOCS
1990
IEEE
15 years 2 months ago
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
The lattice reduction algorithm of Gauss is shown to have an average case complexity which is asymptotic to a constant.
Brigitte Vallée, Philippe Flajolet