Sciweavers

5630 search results - page 128 / 1126
» Computability in Specification
Sort
View
ISMVL
2002
IEEE
84views Hardware» more  ISMVL 2002»
15 years 9 months ago
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
Zeljko Zilic, Katarzyna Radecka
DEXAW
1995
IEEE
93views Database» more  DEXAW 1995»
15 years 7 months ago
Meta Modeling for End User Computing
Inherent constraints play an important role in the semantic Xplain model. These constraints enable us to represent certain real world knowledge once for subsequent use in several ...
J. H. ter Bekke
AAAI
2008
15 years 6 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
LREC
2010
246views Education» more  LREC 2010»
15 years 5 months ago
Computational Linguistics for Mere Mortals - Powerful but Easy-to-use Linguistic Processing for Scientists in the Humanities
Delivering linguistic resources and easy-to-use methods to a broad public in the humanities is a challenging task. On the one hand users rightly demand easy to use interfaces but ...
Rüdiger Gleim, Alexander Mehler
WCET
2008
15 years 5 months ago
Computing time as a program variable: a way around infeasible paths
Conditional branches connect the values of program variables with the execution paths and thus with the execution times, including the worstcase execution time (WCET). Flow analys...
Niklas Holsti