Sciweavers

774 search results - page 26 / 155
» Markov incremental constructions
Sort
View
VLDB
1992
ACM
100views Database» more  VLDB 1992»
14 years 1 months ago
Principles of Transaction-Based On-Line Reorganization
For very large databases such as those used by banks and airlines, cost considerations may forbid shutting down the service for a long period of time and reorganizing off-line. Si...
Betty Salzberg, Allyn Dimock
UAI
1998
13 years 10 months ago
An Anytime Algorithm for Decision Making under Uncertainty
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, start...
Michael C. Horsch, David Poole
DEXAW
2004
IEEE
166views Database» more  DEXAW 2004»
14 years 22 days ago
Dynamic Semantics for a Controlled Natural Language
In this paper I present a dynamic approach for constructing an unambiguous semantic representation for a text written in a controlled natural language called PENG. The semantic re...
Rolf Schwitter
OOPSLA
2005
Springer
14 years 2 months ago
Constructing a metacircular Virtual machine in an exploratory programming environment
Can virtual machine developers benefit from religiously observing the principles more often embraced for exploratory programming? To find out, we are concurrently constructing two...
David Ungar, Adam Spitz, Alex Ausch
BMCBI
2010
101views more  BMCBI 2010»
13 years 9 months ago
Hidden Markov model speed heuristic and iterative HMM search procedure
Background: Profile hidden Markov models (profile-HMMs) are sensitive tools for remote protein homology detection, but the main scoring algorithms, Viterbi or Forward, require con...
L. Steven Johnson, Sean R. Eddy, Elon Portugaly