Sciweavers

11484 search results - page 496 / 2297
» Modeling in the Large and Modeling in the Small
Sort
View
TCS
1998
15 years 6 months ago
Unary PCF is Decidable
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
Ralph Loader
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
16 years 7 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
DFG
2009
Springer
16 years 1 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
ECMDAFA
2009
Springer
138views Hardware» more  ECMDAFA 2009»
16 years 1 months ago
A Pattern Mining Approach Using QVT
Model Driven Software Development (MDSD) has matured over the last few years and is now becoming an established technology. Models are used in various contexts, where the possibili...
Jens Kübler, Thomas Goldschmidt
FGR
2008
IEEE
134views Biometrics» more  FGR 2008»
16 years 1 months ago
HMM parameter reduction for practical gesture recognition
We examine in detail some properties of gesture recognition models which utilize a reduced number of parameters and lower algorithmic complexity compared to traditional hidden Mar...
Stjepan Rajko, Gang Qian