Sciweavers

1523 search results - page 137 / 305
» The Computational Complexity of Linear Optics
Sort
View
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
14 years 4 days ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
HAPTICS
2002
IEEE
14 years 3 months ago
Simulated Interactive Needle Insertion
A novel interactive virtual needle insertion simulation is presented. Simulation models are based upon planar tissue deformations and forces measured during needle insertion exper...
Simon P. DiMaio, S. E. Salcudean
VLSID
1997
IEEE
109views VLSI» more  VLSID 1997»
14 years 2 months ago
Delay-Insensitive Carry-Lookahead Adders
Integer addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adde...
Fu-Chiung Cheng, Stephen H. Unger, Michael Theobal...
CIE
2008
Springer
14 years 4 days ago
Deterministic Graphical Games Revisited
We revisit the deterministic graphical games of Washburn. A deterministic graphical game can be described as a simple stochastic game (a notion due to Anne Condon), except that we ...
Daniel Andersson, Kristoffer Arnsfelt Hansen, Pete...
CSR
2008
Springer
13 years 12 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann